C
OSTRUZIONEA
UTOMI AS
TATIF
INITI PER ILR
ICONOSCIMENTO DIL
INGUAGGIR
EGOLARIDato il Linguaggio:
generare la grammatica
darne la classificazione
costruire l’automa a stati finiti per il suo riconoscimento
1. (d*ab)+d+(a*b)*c 2. (a+b+)+(dca*|cb+(ab)*) 3. (ab*(fb)+|dc*a)*ec* 4. (a*b+c)+((db)*)+ 5. ((a*b+c)+(db)*)+
6. (a+b+c)+(db|bg)*(e+d+a*b*)+ 7. (a+b*c+)+(a+(cb)*c+)*
III
S
OLUZIONI1. (d*ab)+d+(a*b)*c S -> Ac
A -> Bb | C B -> Ba | A C -> Cd | Dd D -> Eab E -> Ed | D | ε Tipo 3
{1,3}
{1,4,5}
{2,5}
{5,6}
{1,3,5,6}
2. (a+b+)+(dca*|cb+(ab)*) S -> aS | aA
A -> bA |bS | bB B -> dcC | cD C -> aC | ε D -> bD | bE E -> abE | ε
Tipo 3
3. (ab*(ab)+|dc*a)*ec* S -> Sc | Ae A -> B | C | ε B -> Bfb | Dfb D -> Db | Aa C -> Ea E -> Ec | Ad
Tipo 3
4. (a*b+c)+((db)*)+
S -> aS | A
A -> bA | bcS | bcB B -> dbB | ε
Tipo 3
5. ((a*b+c)+(db)*)+ S -> aS | A
A -> bA | bcS | bcB B -> dbB | S | ε Tipo 3
6. (a+b+c)+(db|bg)*(e+d+a*b*)+
S -> aS | aA
A -> bA | bcS | bcB B -> dbB | bgB | C C -> eC | eD D -> dD | dE E -> aE | F F -> bF | C | ε Tipo 3
7. (a+b*c+)+(a+(cb)*c+)* S aS | aA
A bA | B B cB | cS | cC C D | ε D aD | aE E cbE | F F cF | cC Tipo 3
{5,7}