Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    COM555 Lecture 9 - Preparation To Midterm Exam - Questions

    Uploaded by

    Kurdeen Khairy
    This document provides sample questions to prepare for a midterm exam on theory of computation. It lists question types that may appear on the exam such as designing nondeterministic finite automata, converting NFAs to deterministic finite automata, designing deterministic finite automata, and working with regular expressions.

    Copyright:

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

    You might also like

    COM555 Lecture 9 - Preparation To Midterm Exam - Questions

    Uploaded by

    Kurdeen Khairy
    14 views13 pages
    This document provides sample questions to prepare for a midterm exam on theory of computation. It lists question types that may appear on the exam such as designing nondeterministic finite automata, converting NFAs to deterministic finite automata, designing deterministic finite automata, and working with regular expressions.

    Original Description:

    Original Title

    COM555 Lecture 9 - Preparation to Midterm Exam - Questions (2)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides sample questions to prepare for a midterm exam on theory of computation. It lists question types that may appear on the exam such as designing nondeterministic finite automata, converting NFAs to deterministic finite automata, designing deterministic finite automata, and working with regular expressions.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    14 views13 pages

    COM555 Lecture 9 - Preparation To Midterm Exam - Questions

    Uploaded by

    Kurdeen Khairy
    This document provides sample questions to prepare for a midterm exam on theory of computation. It lists question types that may appear on the exam such as designing nondeterministic finite automata, converting NFAs to deterministic finite automata, designing deterministic finite automata, and working with regular expressions.

    Copyright:

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

    COM555

    Theory of Computation
    Lecture 9
    Preparation to Midterm Exam
    Sample Questions
    Assoc Prof Dr Melike Sah Direkoglu
    melike.sah@neu.edu.tr
    NFA Design Questions
    NFA to DFA Conversion Question
    DFA Design Question
    Regular Expression Questions

    You might also like