Concatenation of regular languages [closed]
-
19-10-2022 - |
문제
Suppose we have two language
L = {0^n|n>=0}
M = {1^n|n>=0}
We know both of these are regular languages.
Will L.M (concatenation) be a regular language? Please explain your answer and if yes then what will be its expression?
Thanks for any help in advance.
올바른 솔루션이 없습니다
제휴하지 않습니다 StackOverflow