hw6 - Spring 10: CSci 4011Formal Languages and Automata...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: Spring 10: CSci 4011Formal Languages and Automata Theory 40 points Homework 6 Out Fri., 3/05 Due Fri., 3/12 Please review the instructions given with Homework 1, as they apply to this home- work, too. Please hand in your answers to the following. Note: All Exercise/Problem/Theorem/etc. numbers correspond to the U.S. 2nd edition of the Sipser text. If you have the International edition, please check that the numbers match the ones in the U.S. edition. 1. Give a CFG for the language { a i b j c k | i = j or j = k and i, j, k } . It is known that this language can be generated only by an ambiguous grammar. Argue that your grammar is ambigu- ous by demonstrating that some string (of your choice) in the language has two different parse trees. 2. Ex. 2.13, p. 129. For part (b) use the Pumping Lemma for regular languages. 3. Give a PDA for the language { a i b j c i + j | i, j, k } . Give both a state diagram and a formal specification (the latter as in Example 2.14, p. 112). Design the PDA directly from the languagespecification (the latter as in Example 2....
View Full Document

This note was uploaded on 10/21/2011 for the course CSCI 4011 taught by Professor Nadathur during the Spring '08 term at Minnesota.

Page1 / 2

hw6 - Spring 10: CSci 4011Formal Languages and Automata...

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