Scribd Logo
Upload

Welcome to Scribd!

  • AT Assg1

    Uploaded by

    onkar.kapuskari221
    6 views4 pages
    1. The document discusses the differences between deterministic finite automata (DFA) and non-deterministic finite automata (NFA). 2. In a DFA, each state and input symbol combination leads to a single next state, whereas in an NFA, a state and input can lead to multiple possible next states. 3. NFAs are more expressive and can recognize languages that DFAs cannot, but DFAs are easier to implement in practice since they do not allow ambiguities in state transitions.

    Original Description:

    Original Title

    AT assg1

    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
    1. The document discusses the differences between deterministic finite automata (DFA) and non-deterministic finite automata (NFA). 2. In a DFA, each state and input symbol combination leads to a single next state, whereas in an NFA, a state and input can lead to multiple possible next states. 3. NFAs are more expressive and can recognize languages that DFAs cannot, but DFAs are easier to implement in practice since they do not allow ambiguities in state transitions.

    Copyright:

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

    AT Assg1

    Uploaded by

    onkar.kapuskari221
    1. The document discusses the differences between deterministic finite automata (DFA) and non-deterministic finite automata (NFA). 2. In a DFA, each state and input symbol combination leads to a single next state, whereas in an NFA, a state and input can lead to multiple possible next states. 3. NFAs are more expressive and can recognize languages that DFAs cannot, but DFAs are easier to implement in practice since they do not allow ambiguities in state transitions.

    Copyright:

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

    NAME Onkar kap uskQ M W T

    CIT-B) Page No.:


    YOUVA
    Date:

    Q)De)gn aPA that accegts a.


    So^:

    a DPA that recos


    +e ptten abac
    Lor susig)

    nab'
    W T

    Page No.:

    Date:
    YOUVA
    Q.4 LsB" a

    L= /ab), nzo 3
    ebab
    Soln L= ab,oht
    Paga No
    YOUVA

    at mat 4
    AL sheo length
    0, 1 O,!

    3
    Set of natural nos. cahich a t

    Auonala il Autemata
    NÊA: Non dekrminigke inie thete is matthn an
    nonduminHe t
    is said to he
    state

    kak Aukamaka e Aukemata


    DEA.: Pedaminnhe an
    detaminste f omhpemding
    Suidto be ly
    ieIllant sheue e thete s

    thed Canbe
    ay asd of shings

    fomad
    vOUVA

    DA

    fox each sym bolcrted. -’Ne need to speuty hoe does

    stale +ranhon io DA symbol

    Empty shng tronsikion


    Ennphy
    hant
    7DEA Con be wndeestood as ne ’NEA can be curdeesead as
    mulhpl bte machis

    -laNPA,ea chprd stetean


    In DFA, the net pousible stat
    inpt symbal can hovemet

    T? DEA js moY dhËuult taloashutNÊA is ean to cmial

    NEAs

    Drad is not cllowed Dead comg is

    is allowed
    ÞBaktang pass be

    move s not alo w e


    NA

    You might also like