Jump to content

How do we prove that a subset or a reg language is regular?

wholegrain
in Homework Help

Featured Replies

Show that if L is a regular language, then LR = fwR : w 2 Lg is also a regular
language. (Note: this means that the words in LR are all of the words of L written in
reverse.) (Hint: start with a DFA and make an NFA).

 

If I understand well, I just have to write a random DFA with a random number of states and alphabet of my choosing and do exactly the reverse, and finally convert it to a NFA?

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.