Content deleted Content added
Line 63:
You are correct. It is bad language. Let me try a fix. ([[User:Ashutosh y0078|Ashutosh Gupta]] ([[User talk:Ashutosh y0078|talk]]) 13:34, 16 August 2011 (UTC))
Thank you. It looks better now. Also I suggest:
DFAs are equivalent in computing power to [[nondeterministic finite automata]] (NFAs). This is because, firstly any DFA is also an NFA, so an NFA can do what a DFA can do. Also, given an NFA, one can build a DFA that recognizes the same language as the NFA, although the DFA could have exponentially larger number of states than the NFA. [[User:Raghunandan ma|Raghunandan ma]] ([[User talk:Raghunandan ma|talk]]) 06:46, 17 August 2011 (UTC)
| |||