Concatenation of regular languages [closed]

StackOverflow https://stackoverflow.com/questions/22161508

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.

Pas de solution correcte

Licencié sous: CC-BY-SA avec attribution
Non affilié à StackOverflow
scroll top