Content deleted Content added
Undid revision 1169844952 by 2806:105E:F:4EB1:6816:4AFA:8FC7:3D3D (talk) |
Tag: Reverted |
||
Line 244:
==Application of NFA==
NFAs and DFAs are equivalent in that if a language is recognized by an NFA, it is also recognized by a DFA and vice versa. The establishment of such equivalence is important and useful. It is useful because constructing an NFA to recognize a given language is sometimes much easier than constructing a DFA for that language. It is important because NFAs can be used to reduce the complexity of the mathematical work required to establish many important properties in the [[theory of computation]]. For example, it is much easier to prove [[Regular languages#Closure properties|closure properties]] of [[regular language]]s using NFAs than DFAs.NFA's are used in lexical analyzers,computer bots,state charts ,games such as tic-tac-toe,Ludo and playing cards.
==See also==
| |||