Jump to content

Finite Automata limitations

drwho
in Computer Science

Featured Replies

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?

  • 3 weeks later...

try using pumping lemma theorem to prove it is regular. its much easier as you can handle it as a regular expression itself

Edited by glitch

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.