13) Which of the following is not possible algorithmically ?
Answer is:
Non-deterministic PDA to deterministic PDA
Related Theory of Computation MCQ with Answers
Answer is:
all of these
Explanation:
The language of all words with at least 2 a's can be described by the regular expression
(ab)*a and a (ba)*
(a + b)* ab* a (a + b)*
b* ab* a (a + b)*