finite automata - W(WR)* regular? -
l= {w(wr)* },w=(a+b)* wr reverse of w. language regular?
according me should not regular there can case when can have w(wr) not regular in book answer regular.
can explain ?
the trick star. (wr)* includes empty word. l includes words w catenated empty word, i.e. words w. , set of words is, of course, regular.
for w(wr)^+ things quite different. star reverses of many, many words of language.
Comments
Post a Comment