Scribd Logo
Upload

Welcome to Scribd!

  • Automata Assignment

    Uploaded by

    Junaid Jay
    7 views1 page
    The document provides instructions for Assignment 4 that is due on October 21, 2013. Students are asked to: 1) Perform operations to convert regular expressions to NFAs and NFAs to DFAs, minimizing the resulting DFAs. 2) Answer questions from the textbook on finite automata, regular expressions, and converting between Moore and Mealy machines. 3) Create a Mealy machine that adds 4 to binary input numbers.

    Original Description:

    RE to NFA

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for Assignment 4 that is due on October 21, 2013. Students are asked to: 1) Perform operations to convert regular expressions to NFAs and NFAs to DFAs, minimizing the resulting DFAs. 2) Answer questions from the textbook on finite automata, regular expressions, and converting between Moore and Mealy machines. 3) Create a Mealy machine that adds 4 to binary input numbers.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Automata Assignment

    Uploaded by

    Junaid Jay
    The document provides instructions for Assignment 4 that is due on October 21, 2013. Students are asked to: 1) Perform operations to convert regular expressions to NFAs and NFAs to DFAs, minimizing the resulting DFAs. 2) Answer questions from the textbook on finite automata, regular expressions, and converting between Moore and Mealy machines. 3) Create a Mealy machine that adds 4 to binary input numbers.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Assignment 4 Given on Oct 8, 2013 Due on Oct 21, 2013 (in class) Instructions: a.

    Submit your handwritten or printed document directly to the instructor. b. Mention your Name, Roll No and Section. c. Plagiarism is heavily penalized d. Later submissions have a penalty too. Any document you submit after the class shall be considered as late. Chapter on NFA 1. Perform these operations to the REs given below, without missing out any intermediary step. (i) Convert RE to NFA (ii) Convert NFA created form part (i) to DFA (iii) Minimize the DFA created in part (ii) a) a*(bb)* b) (abb)* c) (a+b)*(aa+bb)(a+b)* d) (ab+b)* Following questions are given from the book Introduction to Computer Theory by Daniel I. A. Cohen (soft form is also uploaded on slate). As the question numbers are given please use the same edition as other editions may have difference question numbers. Chapter 9: Questions: 1,5,8,9,10,14,15 a) Convert Moore machine given in question 9,10 to Mealy machine. b) Convert Mealy machine given in question 16,17 to Moore machine. c) Make a Mealy machine that adds 4 to the input binary number. Chapter 9: a) Questions: 1,2,3,4,7,8,10,11,12,13,14

    Mehreen Alam Theory of Automata Fall 2013

    Page 1

    You might also like