1. Recursively enumerable language are a. A proper superset CFL b. Always recognized by PDA c. Are...
Fantastic news! We've Found the answer you've been seeking!
Question:
1. Recursively enumerable language are
a. A proper superset CFL
b. Always recognized by PDA
c. Are Also called type of 0 language
d. Always recognized by FSA
2. If the language A contains λ. then A must be regular.
a. True
b. Fasle
3. Which of the following can represent {a n b m | 0 ≤ n, 0 ≤ m}
a. DFA, NFA, Regular expression.
b. CFG (Context Free grammer)
c. Turning Machine
d. All of them.
4. Which of the following can represent {a n b n | n > =0}
a. DFA
b. NFA
c. PDA ( Push Down Automata)
d. All of the them
5. Which of the following can represent {a n b n c n | n >=0}
a. DFA
b. Turning Machine
c. PDA
d. All of them
Related Book For
Posted Date: