2) Consider the following languages over the alphabet ={a,b,c}. If they are regular find a regular...

Transcribed Image Text:

2) Consider the following languages over the alphabet ={a,b,c}. If they are regular find a regular expression that defines the language. Otherwise, prove that thay are non-regular using pumping lemma. i) L1={a "b"c | n,m0} ii) L2={a"bc" | n 0} 2) Consider the following languages over the alphabet ={a,b,c}. If they are regular find a regular expression that defines the language. Otherwise, prove that thay are non-regular using pumping lemma. i) L1={a "b"c | n,m0} ii) L2={a"bc" | n 0}

Answer rating: 100% (QA)

The question asks us to consider two languages L1 and L2 over the alphabet abc We must determine if each language is regular If a language is regular ... View the full answer