ALM – (Case Study)
Automata Theory and Formal Language
CO-1
1. “Power of both DFA (Deterministic Finite Automata) and NDFA (Nondeterministic Finite Automata) are same”- Explain. (With 100 words).
ANS:
The ability of DFA (Deterministic Finite Automata) and NDFA (Nondeterministic Finite Automata) to identify the same set of regular languages is
what gives them equal strength. This implies that an equivalent NDFA can
recognise any language that a DFA can, and vice versa, for any language that a
DFA can recognise.
DFAs and NDFAs have different computational models, yet they both have
similar expressive capacity, and they can be converted between one another. The
primary distinction between the two is that although DFAs can only be in one
state at a time, NDFAs can be in numerous states simultaneously. All regular
languages can be recognised by both models, hence this has no impact on their
capacity to recognise them.