Skip to main content
Meyer's user avatar
Meyer's user avatar
Meyer's user avatar
Meyer
  • Member for 7 years, 7 months
  • Last seen more than 7 years ago
comment
Proof that {w ∈ {a, b} ∗ | |w|a = |w|b} is not a regular language
It's not exactly the same since I was looking for an exact explanation. The answer is that if you use the pumping lemma you can demonstrate that for a given w = xyz, you have a y that makes the condition goes false. In this case, aaabbb or any a^nb^n makes the case.
awarded
revised
Loading…
Loading…