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

Welcome to Scribd!

  • 49 views

    Theory of Automata and Formal Languages

    Uploaded by

    M N Rao
    This document discusses theory of automata and formal languages. It reviews basic concepts like regular expressions defining languages with operators like *, +. It provides examples of languages like strings with exactly one "aa". It introduces finite automata, defines its components, and provides an example of an FA accepting strings of even length. It also gives some practice problems on building FAs for specific languages and their solutions.

    Copyright:

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

    Theory of Automata and Formal Languages

    Uploaded by

    M N Rao
    49 views12 pages
    This document discusses theory of automata and formal languages. It reviews basic concepts like regular expressions defining languages with operators like *, +. It provides examples of languages like strings with exactly one "aa". It introduces finite automata, defines its components, and provides an example of an FA accepting strings of even length. It also gives some practice problems on building FAs for specific languages and their solutions.

    Original Title

    Lecture 05.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses theory of automata and formal languages. It reviews basic concepts like regular expressions defining languages with operators like *, +. It provides examples of languages like strings with exactly one "aa". It introduces finite automata, defines its components, and provides an example of an FA accepting strings of even length. It also gives some practice problems on building FAs for specific languages and their solutions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    49 views12 pages

    Theory of Automata and Formal Languages

    Uploaded by

    M N Rao
    This document discusses theory of automata and formal languages. It reviews basic concepts like regular expressions defining languages with operators like *, +. It provides examples of languages like strings with exactly one "aa". It introduces finite automata, defines its components, and provides an example of an FA accepting strings of even length. It also gives some practice problems on building FAs for specific languages and their solutions.

    Copyright:

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

    Theory of Automata and

    Formal Languages
    LECTURE 05
    Review
    RE, Recursive definition of RE, defining languages by RE, { x}*, { x}+, {a+b}*,
    Language of strings having exactly one aa, Language of strings of even length,
    Language of strings of odd length, RE defines unique language (as Remark),
    Language of strings having at least one a, Language of strings havgin at least
    one a and one b, Language of strings starting with aa and ending in bb,
    Language of strings starting with and ending in different letters.
    Regular expression of EVEN-EVEN language, Difference between a* + b* and
    (a+b)*, Equivalent regular expressions; sum, product and closure of regular
    expressions; regular languages, finite languages are regular, introduction to
    finite automaton, definition of FA, transition table, transition diagram.
    Note
    It may be noted that to indicate the initial state, an arrow
    head can also be placed before that state and that the final
    state with double circle, as shown below. It is also to be
    noted that while expressing an FA by its transition diagram,
    the labels of states are not necessary.
    a, b

    a, b
    Example
    Σ = {a,b}
    States: x, y, where x is both initial and final state.
    Transitions:
    1.At state x reading a or b go to state y.
    2.At state y reading a or b go to state x.
    Example-
    Continued…
    These transitions can be expressed by
    the following transition table
    Example- Continued…
    It may be noted that the previous transition table may be depicted
    by the following transition diagram.
    Example- Continued…
    The previous transition diagram is an FA accepting the language of
    strings, defined over Σ={a, b} of even length. It may be noted that
    this language may be expressed by the regular expression

    ((a+ b) (a + b))*
    Practice Problem
    Build an FA for the language L of strings, defined over
    Σ={a, b}, of odd length.
    Solution
    Practice Problems
    1. Consider the language, defined over Σ={a, b} of words
    beginning with a

    2. Consider the language, defined over Σ={a, b} of words


    beginning and ending in same letter
    3. Consider the language, defined over Σ={a, b} of words
    ending in b
    4. Consider the language, defined over Σ={a, b} of words not
    ending in a
    Practice Problems-Solutions
    ◦ Determine the RE of the language, defined over Σ={a, b} of words beginning
    with a.
    Solution:
    The required RE may be a(a+b)*
    ◦ Determine the RE of the language, defined over Σ={a, b} of words beginning
    with and ending in same letter.
    Solution:
    The required RE may be (a+b)+a(a+b)*a+b(a+b)*b
    Practice Problems-Solutions
    ◦ Determine the RE of the language, defined over Σ={a, b} of words ending in b.
    Solution:
    The required RE may be
    (a+b)*b.
    ◦ Determine the RE of the language, defined over
    Σ={a, b} of words not ending in a.
    Solution: The required RE may be
    (a+b)*b + Λ Or ((a+b)*b)*

    You might also like