Scribd Logo
Upload

Welcome to Scribd!

  • COM555 Theory of Computation: Nondeterministic Finite Automata (NFA)

    Uploaded by

    Kurdeen Khairy
    16 views13 pages
    This document provides an overview of nondeterministic finite automata (NFA) from a theory of computation lecture. It introduces NFAs, noting they allow nondeterministic transitions where there may be several possible next states from a given state reading a symbol, unlike deterministic finite automata (DFA) which always have a single next state. Examples of NFAs are provided, including N1 which accepts strings containing 101 or 11, and N2 and N3 whose accepted languages are questions for analysis.

    Original Description:

    Original Title

    COM555 Lecture 5 - NFA

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides an overview of nondeterministic finite automata (NFA) from a theory of computation lecture. It introduces NFAs, noting they allow nondeterministic transitions where there may be several possible next states from a given state reading a symbol, unlike deterministic finite automata (DFA) which always have a single next state. Examples of NFAs are provided, including N1 which accepts strings containing 101 or 11, and N2 and N3 whose accepted languages are questions for analysis.

    Copyright:

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

    COM555 Theory of Computation: Nondeterministic Finite Automata (NFA)

    Uploaded by

    Kurdeen Khairy
    This document provides an overview of nondeterministic finite automata (NFA) from a theory of computation lecture. It introduces NFAs, noting they allow nondeterministic transitions where there may be several possible next states from a given state reading a symbol, unlike deterministic finite automata (DFA) which always have a single next state. Examples of NFAs are provided, including N1 which accepts strings containing 101 or 11, and N2 and N3 whose accepted languages are questions for analysis.

    Copyright:

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

    COM555

    Theory of Computation
    Lecture 5
    Nondeterministic Finite Automata (NFA)
    Assoc Prof Dr Melike Sah Direkoglu
    melike.sah@neu.edu.tr
    Nondeterministic Finite Automata (NFA)

    • In a deterministic finite automata, when the


    machine is in a given state and reads the next
    input symbol, we know what is the next state
    will be. This is called deterministic
    computation.
    • In a nondeterministic machine, several choices
    may exist for the next state at any point.
    NFA
    NFA Example
    NFA Difference from DFA
    NFA Difference from DFA

    N1 accepts any
    string that contains
    101 or 11 as
    substring
    Formalization of Nondeterministic Finite
    Automata (NFA)
    Example
    Language of N2?
    Example
    Language of N3?

    You might also like