Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Regular languages and the pumping lemma
- Certain type of regular languages
- Is there an algorithm that can "reverse engineer" a Regular Expression?
- Generating function of a regular language
- Proof that the $\omega$-language consisting of all words containing every finite word as a factor is not rational/regular
- Non-regular languages fulfilling the Pumping Lemma
- A question on regular sets
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.