wholegrain Posted February 19, 2014 Share Posted February 19, 2014 Show that if L is a regular language, then LR = fwR : w 2 Lg is also a regularlanguage. (Note: this means that the words in LR are all of the words of L written inreverse.) (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? 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