Práctica 2: Expresiones regulares (Teoría de Lenguajes)

Ejercicio 02

(Revisar)

• a) D1(10*1) = D1(1).(0*1) = $\lambda$.(0*1) = 0*1
• b) D$\lambda$(10*1) = D$\lambda$(1).(0*1) = 1.0*1
• c) D0(10*1) = D0(1).(0*1) = $\emptyset$.(0*1) = $\emptyset$
• d) Da(ab*|ac|c+) = Da(ab*)|Da(ac)|Da(c+)= Da(a).(b*)|Da(a).c|Da(c).c+ = $\lambda$.b*|$\lambda$.c|$\emptyset$.c+ = b*|c
• e) Da(a+ba) = Da(a+).ba = Da(a).a+.(ba) = $\lambda$.a+.ba = a+ba
• f) Da(a*ba) = Da(a*).ba | Da(ba) = Da(a).a*.ba | Da(b).a = $\lambda$.a*ba | $\emptyset$.a = a*ba
• g) D01(0(1|L)|1+) = D01(0(1|L))| D01(1+) = D01(0).(1|L) | D01(1).1+ = $\emptyset$.(1|L) | $\emptyset$.1+ = $\emptyset$