drwho Posted December 5, 2010 Share Posted December 5, 2010 I am trying to clear something that seems to be a little misleading for me. I know the language over {a,b} consisting of all words containing the same number of occurrences of the symbol a as of the symbol b is not regular. I know that the language L over {a,b} consisting of all words containing the same number of occurrences of ab as a substring as occurrences of ba as a substring actually is regular. What would be the best way to prove this? by finding a finite automaton that accepts this language? Link to comment Share on other sites More sharing options...
glitch Posted December 24, 2010 Share Posted December 24, 2010 (edited) try using pumping lemma theorem to prove it is regular. its much easier as you can handle it as a regular expression itself Edited December 24, 2010 by glitch Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now