Home /
Expert Answers /
Computer Science /
prove-that-the-language-l-of-all-the-sequences-that-have-exactly-the-same-numbers-of-a-39-s-and-h-39-pa311
(Solved): Prove that the language L of all the sequences that have exactly the same numbers of a's and h's is ...
Prove that the language L of all the sequences that have exactly the same numbers of a's and h's is not regular. For example, the word haha is in the language L, while the word ahh is not in L.