Can I read Proving Non-Regular Languages with DFA on EtoBox?
Proving Non-Regular Languages with DFA by theresa.painter is a document available to read on EtoBox.
What is Proving Non-Regular Languages with DFA about?
The document discusses proofs that certain languages are non-regular by using contradictions. It first proves that the language {a^ib^i | i >= 0} is non-regular by showing that if there was a DFA that accepted it, there would be a string it should accept but does not. It then shows another example language {1^k2 | k > 0} is non-regular using a similar proof. It also introduces the pumping lemma for regular languages and proves it holds by considering repeated states in a DFA. Finally, it poses proving a new
- Author
- theresa.painter
- Language
- EN