Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Lecture 6

    Uploaded by

    tonycamehome2022

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Lecture 6

    Uploaded by

    tonycamehome2022
    6 views19 pages

    Original Title

    lecture 6

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    6 views19 pages

    Lecture 6

    Uploaded by

    tonycamehome2022

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 19

    CSE322

    Minimization of finite Automaton &


    REGULAR LANGUAGES

    Lecture #5
    Definitions
    Properties
    Construction of Minimum Automaton
    Problem
    • Construct a minimum state automaton
    equivalent to finite automaton
    Solution
    Minimize the given automata
    Regular Languages
    Definition: L
    M
    A language is regular L  
    L isM
    if there
    FA such that

    Observation:
    All languages accepted by FAs
    form the family of regular languages

    17
    Examples of regular languages:

    abba  , ab, abba


    awa : w  a, b * {a nb : n 0}
    { all strings with prefix }
    ab
    { all strings without substring }
    001

    There exist automata that accept these


    Languages (see previous slides).

    18
    There exist languages which are not Regular:

    n n
    Example:
    L{a b : n 0}

    There is no FA that accepts such a language

    (we will prove this later in the class)

    19

    You might also like