Scribd Logo
Upload

Welcome to Scribd!

  • Assignment # 1

    Uploaded by

    Muhammad Uzair Rajput
    3 views2 pages
    This document contains 5 questions for an assignment on automata theory. It asks students to list reasons for studying automata theory, discuss the relationships between automata, languages and computation, explain the difference between deterministic and non-deterministic finite automata with examples, write formal definitions for three deterministic finite automata including their transition functions and tables, and convert three non-deterministic finite automata into deterministic finite automata.

    Original Description:

    task theory of automata

    Original Title

    Assignment # 1 (2)

    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 contains 5 questions for an assignment on automata theory. It asks students to list reasons for studying automata theory, discuss the relationships between automata, languages and computation, explain the difference between deterministic and non-deterministic finite automata with examples, write formal definitions for three deterministic finite automata including their transition functions and tables, and convert three non-deterministic finite automata into deterministic finite automata.

    Copyright:

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

    Assignment # 1

    Uploaded by

    Muhammad Uzair Rajput
    This document contains 5 questions for an assignment on automata theory. It asks students to list reasons for studying automata theory, discuss the relationships between automata, languages and computation, explain the difference between deterministic and non-deterministic finite automata with examples, write formal definitions for three deterministic finite automata including their transition functions and tables, and convert three non-deterministic finite automata into deterministic finite automata.

    Copyright:

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

    Department of Computer Science

    Theory of Automata (Assignment # 1)

    Question # 1. List and explain at least five reasons of studying automata theory.
    Question # 2. Discuss how Automata, Languages and Computation are related to each other.
    Question # 3. What is difference between Deterministic Finite Automata and Non-
    Deterministic Finite Automata? Discuss with examples.
    Question # 4. Write the formal definition of following Deterministic Finite Automata (including
    transition function and transition table).
    (i)

    (ii)
    (iii)

    Question # 5. Convert following NFAs to DFAs.

    (i)

    (ii)

    (iii)

    THE END

    You might also like