Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Mark Joshua Reyes Bscs 3-A: Initial State and Ends With Final State/s)

    Uploaded by

    Josh Reyes
    The document contains the answers to an activity regarding finite automata (FA). It lists the strings accepted by a given FA, provides examples of strings w that are evaluated by the FA, shows the transition diagram and transition table of an FA with states S1, S2, S3 and input symbols 0 and 1.

    Copyright:

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

    You might also like

    Mark Joshua Reyes Bscs 3-A: Initial State and Ends With Final State/s)

    Uploaded by

    Josh Reyes
    5 views2 pages
    The document contains the answers to an activity regarding finite automata (FA). It lists the strings accepted by a given FA, provides examples of strings w that are evaluated by the FA, shows the transition diagram and transition table of an FA with states S1, S2, S3 and input symbols 0 and 1.

    Original Description:

    Original Title

    activity 1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains the answers to an activity regarding finite automata (FA). It lists the strings accepted by a given FA, provides examples of strings w that are evaluated by the FA, shows the transition diagram and transition table of an FA with states S1, S2, S3 and input symbols 0 and 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views2 pages

    Mark Joshua Reyes Bscs 3-A: Initial State and Ends With Final State/s)

    Uploaded by

    Josh Reyes
    The document contains the answers to an activity regarding finite automata (FA). It lists the strings accepted by a given FA, provides examples of strings w that are evaluated by the FA, shows the transition diagram and transition table of an FA with states S1, S2, S3 and input symbols 0 and 1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    Mark Joshua Reyes BSCS 3-A

    ACTIVITY I

    Answers

    1. The strings that are accepted by the given D FA are b. 01101, c. 01 and d. 0 (starts with
    initial state and ends with final state/s)

    2. w = 01
    w = 011
    w = 10
    w = 101
    w = 0101

    3. Q/ Σ 0 1
    S1 S2 S3
    S2 S2 S2
    S3 S3 S3

    0
    4. Transition Diagram
    0 0
    A B C

    1
    1 1

    0,1
    Transition Table

    Q/ Σ 0 1
    A B D
    B C D
    C C D
    D D D

    You might also like