myhill nerode theorem gives necessary sufficient condition formal language regular exact count number states minimal machine language pumping lemma regular languages also useful regularity proofs proven period michael rabin dana scott along computational equivalence deterministic nondeterministic finite automata body algebraic results known structure theory algebraic decomposition theory emerged dealt realization sequential machines smaller machines interconnection ref name structure theory ref
Formal science Computer science Theory of computation Automata theory