Scribd Logo
Upload

Welcome to Scribd!

  • 14.1.2.-THOMPSON - Alumnos-Conversion de E.R. A Automata

    Uploaded by

    Axel Molina Mendez
    8 views13 pages
    The document describes converting a regular expression 10*1 into a finite state automaton. It shows the steps of assigning state sets to each symbol and transitioning between states with the corresponding symbols. The resulting finite state automaton has states S0={0}, S1={1,2,3,5}, S2={4,3,5}, S3={6} with S3 as the accepting state that recognizes the language of the regular expression 10*1.

    Original Description:

    Diagrama de Thompson a Ecuacion autonamata

    Original Title

    14.1.2.-THOMPSON -Alumnos-Conversion de E.R. a Automata

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes converting a regular expression 10*1 into a finite state automaton. It shows the steps of assigning state sets to each symbol and transitioning between states with the corresponding symbols. The resulting finite state automaton has states S0={0}, S1={1,2,3,5}, S2={4,3,5}, S3={6} with S3 as the accepting state that recognizes the language of the regular expression 10*1.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views13 pages

    14.1.2.-THOMPSON - Alumnos-Conversion de E.R. A Automata

    Uploaded by

    Axel Molina Mendez
    The document describes converting a regular expression 10*1 into a finite state automaton. It shows the steps of assigning state sets to each symbol and transitioning between states with the corresponding symbols. The resulting finite state automaton has states S0={0}, S1={1,2,3,5}, S2={4,3,5}, S3={6} with S3 as the accepting state that recognizes the language of the regular expression 10*1.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 13

    MÉTODO DE THOMPSON

    Partiendo de la E.R. 10*1 hallar un autómata que reconozca el


    mismo lenguaje
    Conversión de la expresión regular 10*1 en autómata

    0
    3 4

    1
    𝟏
    0 1 2 5 6

    • 0= {0}
    • 1= {1,2,3,5}
    2= {2,3,5}
    • 3= {3}
    • 4= {3,4,5}
    • 5= {5}
    • 0= {0} 𝜆 0 1
    • 1= {1,2,3,5} 𝑆0 =0
    2= {2,3,5}
    • 3= {3}
    • 4= {4,3,5}
    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5

    2= {2,3,5}

    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    1,2,3,5
    2= {2,3,5}

    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    1,2,3,5 4,3,5
    2= {2,3,5}

    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    1,2,3,5 4,3,5 6
    2= {2,3,5}

    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    1,2,3,5 4,3,5 6
    2= {2,3,5}
    4,3,5
    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    1,2,3,5 4,3,5 6
    2= {2,3,5}
    4,3,5 4,3,5
    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1

    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    1,2,3,5 4,3,5 6
    2= {2,3,5}
    4,3,5 4,3,5 6
    • 3= {3}

    • 4= {4,3,5}

    • 5= {5,6}

    0
    S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    • 0= {S0} 𝜆 0 1
    S0={0}
    • 1= {1,2,3,5} 𝑆0 =0 1,2,3,5
    S1={1,2,3,5}
    1,2,3,5 4,3,5 6
    2= {2,3,5}
    4,3,5 4,3,5 6 S2={4,3,5}
    • 3= {3} 6
    S3={6}
    • 4= {4,3,5}
    𝑆0= S0
    • 5= {5,6}
    𝑆1= {1,2,3,5}
    • F={S6}
    𝑆2= {4,3,5}
    0
    S3= {6} ,F=S3 S3 S4

    1
    𝟏
    S0 S1 S2 S5 S6
    𝜆 0 1

    𝑆0 =0 1,2,3,5
    1,2,3,5 4,3,5 6
    4,3,5 4,3,5 6
    6

    𝜆 0 1
    𝑆0= S0
    S0 S1
    𝑆1= {1,2,3,5}
    S1 S2 S3
    𝑆2= {4,3,5} S2 S2 S3
    F={S3}
    S3= {6} S3
    𝜆 0 1

    S0 S1
    S1 S2 S3
    S2 S2 S3
    F={S3}
    S3

    1
    1 S1 S3

    S0 0
    10*1
    1
    S2
    𝑏

    You might also like