The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees.
| A. | Two |
| B. | Three |
| C. | Four |
| D. | Five |
|
Option: C Explanation : Click on Discuss to view users comments. |
| A. | Performance |
| B. | Reliability |
| C. | Usability |
| D. | Portability |
|
Option: C Explanation : Click on Discuss to view users comments. |
| A. | (a+b)*bbb |
| B. | abbb(a+b)* |
| C. | (a+b)*(bbb)(a+b)* |
| D. | (a+b)(bbb)(a+b)* |
|
Option: C Explanation : Click on Discuss to view users comments. |
There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.
| A. | 64 |
| B. | 256 |
| C. | 1024 |
| D. | 5832 |
|
Option: D Explanation : Click on Discuss to view users comments. |
Given the following two languages :
L1 ={anban|n>0}
L2 ={anban bn+1 |n>0}
Which of the following is correct?
| A. | L1 is context free language and L2 is not context free language |
| B. | L1 is not context free language and L2 is context free language |
| C. | Both L1 and L2 are context free languages |
| D. | Both L1 and L2 are not context free languages |
|
Option: A Explanation : Click on Discuss to view users comments. |
