2000-Automata_and_Formal_Languages-scanned - Comprehensive...

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

View Full Document Right Arrow Icon
Comprehensive Exam: Autumn 2000-01 Automat a and Formal Languages (60 points) Problem 1. [lo points] Consider the language L defined by the regular expression 00'10. Provide a PDA M for this language using as few states as possible. Note that there is a PDA with only 1 state and that the number of points you get will depend on the number of states used in your solution. Problem 2. [18 points] Decide whether the following statements are TRUE or FALSE. You will receive 3 points for each correct answer and -2 points for each incorrect answer. 1. If L1 and L2 are both non-regular, then L1 n L2 must be non-regular. 2. L = {w E {a, b, c)' ( w does not contain an equal number of occurrences of a, 6, and c) is context-free. 3. Let L represent the language of a non-deterministic finite-state automaton N; then, swapping the final and non-final states of N gives a machine N' whose language is the complement of L. 4. Assume that
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 / 2

2000-Automata_and_Formal_Languages-scanned - Comprehensive...

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