Scribd Logo
Upload

Welcome to Scribd!

  • Computational Linguistics: Dr. Dina Khattab

    Uploaded by

    Dalia Ahmed
    13 views4 pages
    This document discusses regular expressions and finite state automata. It provides examples of regular expressions for strings containing letters and operators and asks students to draw finite state automata graphs that represent each regular expression. The examples include expressions for strings containing a or b, b repeated 0 or more times, the sequence ab repeated 1 or more times, ab with b repeated 0 or more times followed by c, a followed by b repeated 0 or more times or a repeated 0 or more times, and a repeated 1 or more times followed by b repeated 0 or more times followed by a. A finite state automata graph is provided for the last example regular expression, a+b*a.

    Original Description:

    Original Title

    Untitled

    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
    This document discusses regular expressions and finite state automata. It provides examples of regular expressions for strings containing letters and operators and asks students to draw finite state automata graphs that represent each regular expression. The examples include expressions for strings containing a or b, b repeated 0 or more times, the sequence ab repeated 1 or more times, ab with b repeated 0 or more times followed by c, a followed by b repeated 0 or more times or a repeated 0 or more times, and a repeated 1 or more times followed by b repeated 0 or more times followed by a. A finite state automata graph is provided for the last example regular expression, a+b*a.

    Copyright:

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

    Computational Linguistics: Dr. Dina Khattab

    Uploaded by

    Dalia Ahmed
    This document discusses regular expressions and finite state automata. It provides examples of regular expressions for strings containing letters and operators and asks students to draw finite state automata graphs that represent each regular expression. The examples include expressions for strings containing a or b, b repeated 0 or more times, the sequence ab repeated 1 or more times, ab with b repeated 0 or more times followed by c, a followed by b repeated 0 or more times or a repeated 0 or more times, and a repeated 1 or more times followed by b repeated 0 or more times followed by a. A finite state automata graph is provided for the last example regular expression, a+b*a.

    Copyright:

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

    Computational Linguistics

    Lecture 5

    Dr. Dina Khattab


    dina.khattab@cis.asu.edu.eg
    REGULAR EXPRESSION (REGEX)
    2
    Draw a graph for FSA that represents the
    following regular expressions:
    a | b
    b *
     (ab)+
     ab*c
     a(b*|a*)
     (a | b )*
     a+b*a 3
    a
    a a
    0 1 2

    b b

    a 4
    3
    b

    a+b*a 4

    You might also like