Scribd Logo
Upload

Welcome to Scribd!

  • Designing Dfa

    Uploaded by

    Faheem Abdulrahiman
    3 views7 pages
    The document discusses important points for designing deterministic finite automata (DFAs). It provides examples of DFAs that accept: 1) strings with zero or more 0s; 2) strings with zero or more 1s; 3) strings with one or more 0s; 4) strings with alternating 0s and 1s; 5) strings with one or more alternating 0s and 1s; and 6) strings of the form 01 repeated zero or more times. The DFA diagrams and corresponding accepted languages are given for each example.

    Original Description:

    dfa

    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 discusses important points for designing deterministic finite automata (DFAs). It provides examples of DFAs that accept: 1) strings with zero or more 0s; 2) strings with zero or more 1s; 3) strings with one or more 0s; 4) strings with alternating 0s and 1s; 5) strings with one or more alternating 0s and 1s; and 6) strings of the form 01 repeated zero or more times. The DFA diagrams and corresponding accepted languages are given for each example.

    Copyright:

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

    Designing Dfa

    Uploaded by

    Faheem Abdulrahiman
    The document discusses important points for designing deterministic finite automata (DFAs). It provides examples of DFAs that accept: 1) strings with zero or more 0s; 2) strings with zero or more 1s; 3) strings with one or more 0s; 4) strings with alternating 0s and 1s; 5) strings with one or more alternating 0s and 1s; and 6) strings of the form 01 repeated zero or more times. The DFA diagrams and corresponding accepted languages are given for each example.

    Copyright:

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

    WELCOME TO

    COMPUTER SCIENCE
    HUB
    DESIGNING DFA
    IMPORTANT POINTS FOR DESIGNING DFA

    • If DFA accepts only 0* (ie. Zero or more number of 0’s)


    0

    q0
    L={ε,0,00,000,…}
    • If DFA accepts only 1* (ie. Zero or more number of 1’s)
    1
    q0
    L= {ε,11,111,11111…}
    IMPORTANT POINTS FOR DESIGNING DFA

    • If DFA accepts only 0+ (ie. One or more number of 0’s)


    0 0
    q0
    q0
    L={0,00,000..}
    • If DFA accepts only (0/1)
    0,1
    q0
    q0
    L={0,1}
    IMPORTANT POINTS FOR DESIGNING DFA

    • If DFA accepts (0/1)* L={ε ,0,1,01,0011,1101,10101,111100011…}


    0,1

    q0

    • If DFA accepts only (0/1)+ L={0,1,01,0011,101,1100,111}


    0,1 0,1
    q0
    q0
    IMPORTANT POINTS FOR DESIGNING DFA

    • If DFA accepts only 01 L={01}


    0 1
    q0 q1 q2

    • If DFA accepts only (01)*

    q0
    0 q1
    1 L={ 01,0101,010101,….}
    q2
    0
    THANK YOU!!

    You might also like