Interview Questions on Automata Theory and Languages.

Automata Theory and Languages Questions.

Where is Myhill-Nerode theorem is used? Could you please explain the algorithm?
If I say PDA=FA+2 Stacks, what is FA+3 stacks?
Every regular language is context free. Do you agree? Why?
Can you compare a PDA with a microcomputer?
If I say DFAs are more realistic than NFAs, will you agree with me?
You know that the closure property exists under concatenation of two regular languages.Now explain: an is regular and bn is regular. But why anbn is not regular?
If I say some language is context free, what does it imply?
What would you call the State Diagram of a Process – an NFA or a DFA?
Explain the concept of valid and invalid alphabets.
What is the difference between regular grammar and algebraic grammar?
When do you call a problem decidable?
What is the difference between (a,b) and (a+b)?
Differentiate between Palindrome and Reverse function?
What do you mean by saying that a language is LL(1)?
What is the difference between PLUS and Kleene Star Closure?
Explain how to create a RE of a particular language?
Differentiate between FA and NFA.
What is Pumping Lemma I and II and what is the difference between pumping Lemma 1 and pumping Lemma 2?