Scribd Logo
Upload

Welcome to Scribd!

  • Subsetconst 1

    Uploaded by

    Snowbar Khan
    3 views2 pages
    This document outlines 5 rules for constructing a non-deterministic finite automaton (NFA) from a regular expression: 1) The NFA for epsilon (empty string) has one state connected to the start and final states. 2) The NFA for a terminal symbol has one state connected to the start and final states. 3) The NFA for r1 + r2 combines the NFAs for r1 and r2 with an epsilon transition between their final states and the overall final state. 4) The NFA for r1.r2 chains the NFA for r1 to the NFA for r2 by making the first's final state the second's start state.

    Original Description:

    Original Title

    subsetconst1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines 5 rules for constructing a non-deterministic finite automaton (NFA) from a regular expression: 1) The NFA for epsilon (empty string) has one state connected to the start and final states. 2) The NFA for a terminal symbol has one state connected to the start and final states. 3) The NFA for r1 + r2 combines the NFAs for r1 and r2 with an epsilon transition between their final states and the overall final state. 4) The NFA for r1.r2 chains the NFA for r1 to the NFA for r2 by making the first's final state the second's start state.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views2 pages

    Subsetconst 1

    Uploaded by

    Snowbar Khan
    This document outlines 5 rules for constructing a non-deterministic finite automaton (NFA) from a regular expression: 1) The NFA for epsilon (empty string) has one state connected to the start and final states. 2) The NFA for a terminal symbol has one state connected to the start and final states. 3) The NFA for r1 + r2 combines the NFAs for r1 and r2 with an epsilon transition between their final states and the overall final state. 4) The NFA for r1.r2 chains the NFA for r1 to the NFA for r2 by making the first's final state the second's start state.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    THOMPSON'S CONSTRUCTION

    (CONSTRUCTION OF NFA FROM REGULAR EXPRESSION)

    1.epsilon(e)

    e
    -->(1)(s)--------->(2)(f)

    2.terminal(r)

    r
    -->(1)(s)---------->(2)(f)

    3.r1+r2(or)

    e e
    |----->((nfa for r1)-->(f1))---->---|
    | |
    -> (1)(s)---> ----->(2)(f)
    | e e |
    |----->((nfa for r2)-->(f2))---->---|

    4.r1.r2

    e e e
    ---->(1)(s) ---->{(nfa for r1)(s1)----->(f1)}----->{(nfa for r2)(s2)-->(f2)}----->(2)(f)
    5.r1*

    e
    |<------<----<--<----<|
    e | e |
    --->(1)(s)---->{(nfa for r1)(s)---->(f)}-------->(2)(f)
    | |
    | |
    | e |
    | --->---->------>------->----->------->--->--|

    hence we can contruct the nfa for a regular expression following the above construction
    method for any regular expression given.

    You might also like