Use the pumping lemma to prove that the following language is not regular. (Educational note: This language denotes addi
Posted: Thu Jun 02, 2022 7:46 am
Use the pumping lemma to prove that the following language is not regular. (Educational note: This language denotes addition and tells us that DFAs cannot do arithmetic.) {abcm:n,m ≥ 0} N