Scribd Logo
Upload

Welcome to Scribd!

  • Tutorial 1

    Uploaded by

    Moetassem billah Mikati
    9 views2 pages
    This tutorial document provides exercises to practice describing and analyzing deterministic finite automata (DFAs). It includes state diagrams of sample DFAs M1 and M2, with questions about their start states, accept states, transitions, and whether they accept specific strings. Students are asked to formally define M1 and M2, draw the state diagram of another DFA given its formal definition, and formally define and describe the languages accepted by additional DFA diagrams.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This tutorial document provides exercises to practice describing and analyzing deterministic finite automata (DFAs). It includes state diagrams of sample DFAs M1 and M2, with questions about their start states, accept states, transitions, and whether they accept specific strings. Students are asked to formally define M1 and M2, draw the state diagram of another DFA given its formal definition, and formally define and describe the languages accepted by additional DFA diagrams.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views2 pages

    Tutorial 1

    Uploaded by

    Moetassem billah Mikati
    This tutorial document provides exercises to practice describing and analyzing deterministic finite automata (DFAs). It includes state diagrams of sample DFAs M1 and M2, with questions about their start states, accept states, transitions, and whether they accept specific strings. Students are asked to formally define M1 and M2, draw the state diagram of another DFA given its formal definition, and formally define and describe the languages accepted by additional DFA diagrams.

    Copyright:

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

    Theory of Computations (CMPS 346)

    Tutorial #1

    1. The following are the state diagrams of two DFAs, M1 and M2. Answer the
    following questions about each of these machines

    a. What is the start state?


    b. What is the set of accept states?
    c. What sequence of states does the machine go through on input aabb?
    d. Does the machine accept the string aabb?
    e. Does the machine accept the string ε?

    2. Give the formal description of the machines M1 and M2 pictured in Exercise 1

    3. The formal description of a DFA M is {q1, q2, q3}, {a, b}, δ, q1, {q1, q3}),
    where δ is given by the following table. Draw the state diagram of this machine.

    4. Consider the DFSAs in the following figures. Provide a formal description


    of each one of them. Also, for each one, provide an English description of
    the language accepted by the automata.
    1)

    2)

    3)

    You might also like