Consider the language $$ L = \{0^p 1^q 0^p | p, q ≥ 0\}. $$ How to make a finite automaton for $L$? How to make a regular expression for $L$?
Asked
Active
Viewed 29 times
0
-
1Your language isn't regular. – Yuval Filmus Dec 03 '16 at 14:32
-
You cannot. It is impossible. – PartialOrder Dec 03 '16 at 14:47
-
Welcome to Computer Science! We discourage posts that simply state a problem out of context, and expect the community to solve it. Assuming you tried to solve it yourself and got stuck, it may be helpful if you wrote your thoughts and what you could not figure out. It will definitely draw more answers to your post. Until then, the question will be voted to be closed / downvoted. You may also want to check out these hints, or use the search engine of this site to find similar questions that were already answered. – Raphael Dec 03 '16 at 19:38