2.7. Equivalencia computacional entre los AFN-λ y los ... - UN Virtual
2.7. Equivalencia computacional entre los AFN-λ y los ... - UN Virtual
2.7. Equivalencia computacional entre los AFN-λ y los ... - UN Virtual
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
L(M) = a ∗ b ∗ c ∗ . Las λ-clausuras de <strong>los</strong> estados vienen dadas por:λ[q 0 ] = {q 0 , q 1 , q 2 }.λ[q 1 ] = {q 1 , q 2 }.λ[q 2 ] = {q 2 }.La función de transición ∆ ′ : Q × {a, b, c} → ℘ ({q0 , q 1 , q 2 }) es:∆ ′ (q 0 , a) = λ [∆(λ[q 0 ], a)] = λ [∆({q 0 , q 1 , q 2 }, a)] = λ[{q 0 }] = {q 0 , q 1 , q 2 }.∆ ′ (q 0 , b) = λ [∆(λ[q 0 ], b)] = λ [∆({q 0 , q 1 , q 2 }, b)] = λ[{q 1 }] = {q 1 , q 2 }.∆ ′ (q 0 , c) = λ [∆(λ[q 0 ], c)] = λ [∆({q 0 , q 1 , q 2 }, c)] = λ[{q 2 }] = {q 2 }.∆ ′ (q 1 , a) = λ [∆(λ[q 1 ], a)] = λ [∆({q 1 , q 2 }, a)] = λ[∅] = ∅.∆ ′ (q 1 , b) = λ [∆(λ[q 1 ], b)] = λ [∆({q 1 , q 2 }, b)] = λ[{q 1 }] = {q 1 , q 2 }.∆ ′ (q 1 , c) = λ [∆(λ[q 1 ], c)] = λ [∆({q 1 , q 2 }, c)] = λ[{q 2 }] = {q 2 }.∆ ′ (q 2 , a) = λ [∆(λ[q 2 ], a)] = λ [∆({q 2 }, a)] = λ[∅] = ∅.∆ ′ (q 2 , b) = λ [∆(λ[q 2 ], b)] = λ [∆({q 2 }, b)] = λ[∅] = ∅.∆ ′ (q 2 , c) = λ [∆(λ[q 2 ], c)] = λ [∆({q 2 }, c)] = λ[{q 2 }] = {q 2 }.El autómata M ′ así obtenido es el siguiente:✞☎Ejercicios✝✆1.Construir <strong>AFN</strong> equivalentes a <strong>los</strong> siguientes <strong>AFN</strong>-λ:
Change language