I have two languages and I don't know anything except that the concatenation L1L2 is a regular language. I know that they can be regular/nonregular and it will still apply but what about L2L1? I couldn't find any example that L2L1 is nonregular and I don't know how to prove that either. I tried to think about modify the automata but because one of the languages (or both) may be nonregular it makes non sense. Any clue?
L1L2 is regular and L2L1 is non regular
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.