Diapositiva 1

Gramticas y expresiones regularesG = (t, n, S, P)t = {a,b}n = {S, P, Q}P = { S -> aS, S -> bS, S -> aP, P -> bQ, Q -> b }

Genera L = {xnabb} / n >= 0, x {a,b}*

Es regular a derecha

L puede describirse como: (a|b)*abbExpresiones regulares y AEF(a|b)*.a.b.b8910abb632451ab07

AEFND y AEFDab {0,1,2,4,7}{1,2,3,4,6,7,8}{1,2,4,5,6,7}{1,2,3,4,6,7,8}{1,2,3,4,6,7,8}{1,2,4,5,6,7,9}{1,2,4,5,6,7}{1,2,3,4,6,7,8}{1,2,4,5,6,7}{1,2,4,5,6,7,9}{1,2,3,4,6,7,8}{1,2,4,5,6,7,10}{1,2,4,5,6,7,10}{1,2,3,4,6,7,8}{1,2,4,5,6,7}4321b0babaaabba8910abb632451ab07Conversin de un AFN a un AFD.pdfMinimizacin de AEFD00,2341ababbaabP0 := G1{4} + G2{0,1,2,3}P1 := G1{4} + G2{0,1,2,3} x b G3{3}P2 := G1{4} + G3{3} + G2{0,1,2} x b G4{1}P3 := G1{4} + G3{3} + G2{0,2} + G4{1}4321b0babaaabbaAlgoritmo del AEFD#include int main(){ char c, est; est = '0'; while (1){ c = getchar(); if (c != 'a' && c != 'b') break; switch (est){ case '0': est = (c == 'b') ? '0' : '1'; break; case '1': est = (c == 'a') ? '1' : '3'; break; case '3': est = (c == 'b') ? '4' : '1'; break; case '4': est = (c == 'b') ? '0' : '1'; break; } } printf("Rpta: %c", est); getchar();}