Scribd Logo
Upload

Welcome to Scribd!

  • Tcs Module 1 Nfa-Notes-Rs

    Uploaded by

    Rishabh Shukla
    38 views6 pages
    The document describes the design of non-deterministic finite automata (NFAs) that accept certain strings or languages. It includes: 1. An NFA with states {q0, q1, q2, qa} and transitions that accepts a string containing at least one 'a'. 2. An NFA with states {q0, q1, q2} and transitions that accepts strings ending in 'b'. 3. Steps for converting an NFA to a deterministic finite automaton (DFA).

    Original Description:

    Original Title

    Tcs Module 1 Nfa-notes-rs (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 describes the design of non-deterministic finite automata (NFAs) that accept certain strings or languages. It includes: 1. An NFA with states {q0, q1, q2, qa} and transitions that accepts a string containing at least one 'a'. 2. An NFA with states {q0, q1, q2} and transitions that accepts strings ending in 'b'. 3. Steps for converting an NFA to a deterministic finite automaton (DFA).

    Copyright:

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

    Tcs Module 1 Nfa-Notes-Rs

    Uploaded by

    Rishabh Shukla
    The document describes the design of non-deterministic finite automata (NFAs) that accept certain strings or languages. It includes: 1. An NFA with states {q0, q1, q2, qa} and transitions that accepts a string containing at least one 'a'. 2. An NFA with states {q0, q1, q2} and transitions that accepts strings ending in 'b'. 3. Steps for converting an NFA to a deterministic finite automaton (DFA).

    Copyright:

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

    Poase1

    NEA DROa Shann


    NFAi S

    H-0, 2, 8,2o F
    A i t e Set Stal
    A eniu set Tpu s
    20 = intial sta E
    F=Set a Einak Stoly,ECQR
    S = A transitiom unio
    uncCm

    Sef of a00sudsses

    Tmp Poits
    a he automalon Can
    STals(kstalis, Uo)
    does not go
    goes to
    anyheu
    One STaK
    go O Tuo statR
    Computatio hapþem S ne_Os
    alon eack o thee
    pot
    Aninput isacce he is
    aome Computa ticm batth thal Lead
    to aceept Stae
    ExamAR 1 Pege 2 Dr A a Shan
    NEA Pesiqn an NFA which
    accela a t i n g cohlch contains
    a Le ast One O ewAnC
    abb.

    Fosma stsira
    Corinaltc
    i Any Corrkinollic )ab bATy
    b

    (
    = 2o, 1,2,2a
    2 £a, b3

    2o22, 21 bb6)
    22 F(bb)
    t F(%,e) Halt
    (2o,@bb) bb)
    Leád to Rolt
    bb) (2o,abb).
    +2,b
    Leaalst6
    AcEetance
    Acces
    toge 3
    NFA Ezael 2 Shanana
    Pesign NFto accest a ta
    Stinga endng

    (Amy Cokindkioref

    2 o , 13

    2oD)

    +et9
    E(o,6
    Ha
    neng Patth

    , D (2e, lDE(o,e)
    Halt

    aFind
    , St Stsig is tcceAt
    Page Stsir Rough
    work)

    22
    23
    2 2
    2 ole ol

    Sro 2

    Exam17ccest

    SRjec
    o 2o
    P
    (

    Tentily langnoge
    NA
    he Polo O1no

    An Set a alll ty
    gulsri
    Tutoriak-2
    corstu e ollooing NE A ToDFA

    SteF s):
    b

    NEA M TS3,1o1,8,P,S
    Sta P P 2

    Sto 2-

    You might also like