The problem is as follows: design DFA over an alphabet {a,b}, that accepts a language: L = {$xwx^R$ | $x \in \{a,b\}^+, w \in \{a,b\}^+$}
I have no idea how to remember the first word to be able to detect a reverse of it. I will appreciate any help.
Asked
Active
Viewed 86 times
