Automata

Reversal of DFAs

Reversal of DFA means reverse the language generated by it.
We can get NFA after reversal of DFA (Exception), however we can also get DFA as well


Example:
aabbabab -> bababbaa
Let L is a language starting with 'a', L = {aaa, ab, aaaa, aab, aba, ...}
After taking reversal, LR = {aaa, ba, aaaa, baa, aba, ...}
If langauge is starting with 'a' then LR will end with 'a'


L1 -> (DFAR) -> (L1R) -> NFA/DFA
Note: clearly the language is infinite
You can also take some examples from the previous exercises for practice.



Quantitative Aptitude
Reasoning
Programming
Interview