Concatenation of regular languages [closed]
-
19-10-2022 - |
Question
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.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow