2002-Automata_and_Formal_Languages

2002-Automata_and_Formal_Languages - Comprehensive Exam:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Comprehensive Exam: Autumn 2002-03 Automata and Formal Languages (60 points) Problem 1. [10 points] Recall that a string x is called a substring of another string w if x appears consecutively within w (i.e. w =yxz for some strings y,z ). 1. [3 points] Give a regular expression for the language L = { * w ∈Σ | the string papi is a substring of w }, where Σ is the English alphabet. 2. [7 points] Give a deterministic finite automaton for L . (Partial credit for a nondeterministic finite automaton if you cannot get a DFA.) Problem 2. [10 points] Decide whether the following statements are TRUE or FALSE. You will receive 2 points for each correct answer and –2 points for each incorrect answer. 1. Nondeterministic and deterministic finite automata recognize the same set of languages. 2. Nondeterministic and deterministic pushdown automata recognize the same set of languages. 3. Nondeterministic and deterministic Turing machines recognize the same set of languages. 4.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/18/2011 for the course CS 154 at Stanford.

Page1 / 3

2002-Automata_and_Formal_Languages - Comprehensive Exam:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online