×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Which of the following problems is undecidable? [2007]
2.
Which one of the following statements is FALSE?
3.
Which of the following are decidable?
I. Whether the intersection of two regular languages is infinite
II. Whether a given context-free language is regular
III. Whether two push-down automata accept the same language
IV. Whether a given grammar is context-free
I. Whether the intersection of two regular languages is infinite
II. Whether a given context-free language is regular
III. Whether two push-down automata accept the same language
IV. Whether a given grammar is context-free
4.
Which of the following statements is true?
5.
The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as
6.
If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ?
7.
Consider the languages:
L1 = {anbncm | n, m > 0}
L2 = {anbmcm | n, m > 0}
Which one of the following statements is FALSE?
L1 = {anbncm | n, m > 0}
L2 = {anbmcm | n, m > 0}
Which one of the following statements is FALSE?
8.
Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol and the following set of production rules
S --> aB S --> bA
B --> b A --> a
B --> bS A --> aS
B --> aBB A --> bAA
Which of the following strings is generated by the grammar?
S --> aB S --> bA
B --> b A --> a
B --> bS A --> aS
B --> aBB A --> bAA
Which of the following strings is generated by the grammar?
9.
For the correct answer strings to above question, how many derivation trees are there?
10.
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of