如果 L1L2 正则语言，那么 L2L1 正则？
[英]If L1L2 regular language then L2L1 regular?
问题描述
I have two languages and I don't know anything except that the concatenation L1L2 is a regular language.
我有两种语言，除了连接 L1L2 是一种常规语言之外，我什么都不知道。 I know that they can be regular/nonregular and it will still apply but what about L2L1?我知道它们可以是常规的/非常规的，并且仍然适用，但是 L2L1 呢？ I couldn't find any example that L2L1 is nonregular and I don't know how to prove that either.我找不到任何 L2L1 是非常规的例子，我也不知道如何证明这一点。 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?有什么线索吗？
1 个解决方案
解决方案1
0 2022-08-25 06:14:06
enter image description here在此处输入图像描述
L1L2 is regular and L2L1 is non regular L1L2 是正规的，L2L1 是非正规的
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.