contestada

use the myhill-nerode theorem to prove that the languages in exercise 1.29 (a and c), page 88 and problem 1.46 (b and c) page 90, are not regular. Aa. A1 = {01" 2" | n >0} b. 12 = {www w€ {a,b}*} Ac. Az = {a?" | n >0} (Here, a?" means a means a string of 2" a's.)

Respuesta :

A string, often known as a word, is a limited collection of an alphabet's symbols.

Instances of strings over the letters "a, b" include "b, a" and "aabab," whereas "0, 10" and "001" are examples of strings over the letters "0, 1." A language is a collection of words written in an alphabet. As a result, (b + ab)* can be used to represent a string before the aa. Therefore, if a language string contains aa, the regular expression (b + ab) applies. *aa(b + ba)* The requirement is that every string created by the regular expression must have at least two a's, but there is no restriction on the quantity or placement of b's and c's. Therefore, (a+b+c)*. (a+b+c)*.

Learn more about placement here-

https://brainly.com/question/29229544

#SPJ4