please write a clear answer with the first 5 strings also please
no duplicate answers I'm looking for a new answer
to understand it
a) Prove that the language L is regular: L = { uvu: u,v = {0,1}* }. HINTS: "When in doubt write it out," so write the first 10 smallest strings, see if it helps b) Write a regular expression for L = { uvu: u,v = {0,1}*}.
please write a clear answer with the first 5 strings also please no duplicate answers I'm looking for a new answer to un
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am