(a) Design a Non-deterministic Finite Automata for the language over…
Previous year question for Theory of Computation.
Question
(a) Design a Non-deterministic Finite Automata for the language over {a, b} that ends with aba. Convert it into Deterministic Finite Automata. (10)
(b) Prove that for every NFA that is accepting the language L there exists a DFA which accepts the same language L. (10)
- Year: 2018
- Subject: Theory of Computation
Related pages
More PYQs on Conversion of NFA to DFA
- a) Consider the two regular expressions $R1 = a^*+b^* \quad R2 = ab^*+ab^*+b^*a+(a^*b)^*$. i) Find a string corresponding to R1 but not R2. ii) Find a string c…
- (a) Prove the Arden's Theorem including the proof for unique solutions given by $R = Q P^*$ (b) Construct a DFA equivalent to $M = (\{q_0, q_1, q_2, q_3\}, \{0…