If any language accpeted by a finite automata is regular then why do we convert to a DFA every time we need to prove a language as regular?

35 Views Asked by At

Theory of computation question. since all the automatas we have studied are finite then why do we convert to DFAs while proving any theorems

1

There are 1 best solutions below

0
On

We don't always convert to a DFA. That is just one method to prove that a language is regular. See https://cs.stackexchange.com/q/1331/755 for a range of methods.