Context free grammar is not closed under
| A. | product |
| B. | union |
| C. | complementation |
| D. | kleen star |
|
Option: C Explanation : Click on Discuss to view users comments. |
If L be a language recognizable by a finite automaton, then language front
{L} = { w such that w is prefix of v where v ∈ L }, is a
| A. | regular language |
| B. | context-free language |
| C. | context-sensitive language |
| D. | recursive enumeration language |
|
Option: A Explanation : Click on Discuss to view users comments. |
For which of the following application, regular expressions can not be used ?
| A. | Designing computers |
| B. | Designing compilers |
| C. | Both (a) and (b) |
| D. | Developing computers |
|
|
Consider the following grammar
S --> Ax / By
A --> By/Cw
B --> x / Bw
C--> y
Which of the regular expressions describe the same set of strings as the grammar ?
| A. | xw * y + xw * yx + ywx |
| B. | xwy + xw * xy + ywx |
| C. | xw * y + xw x yx + ywx |
| D. | xw xy + xww * y + ywx |
|
Option: A Explanation : Click on Discuss to view users comments. ritesh said: (5:37pm on Thursday 7th February 2013)
plese tell details for this ques
|
Which of the following statements is (are) correct ?
| A. | Recursive languages are closed under complementation. |
| B. | If a language and its complement are both regular, the language is recursive |
| C. | Set of recursively enumerable language is closed under union |
| D. | All of these |
|
Option: D Explanation : Click on Discuss to view users comments. |
