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

Popular posts from this blog

php - How to display all orders for a single product showing the most recent first? Woocommerce -

asp.net - How to correctly use QUERY_STRING in ISAPI rewrite? -

angularjs - How restrict admin panel using in backend laravel and admin panel on angular? -