hw2 - 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
Spring 10: CSci 4011—Formal Languages and Automata Theory 40 points Homework 2 Out Fri., 1/29 Due Fri., 2/5 Please review the instructions given with Homework 1, as they apply to this home- work, too. Please hand in your answers to the following: 1. Ex. 1.8(b), p. 84. Show also the state diagrams of the automata for the languages of Ex. 1.6c and 1.6f. 2. Ex. 1.9(b), p. 85. Show also the state diagrams of the automata for the languages of Ex. 1.6b and 1.6m. 3. Ex. 1.10(b), p. 85. Show also the state diagram of the automata for the language of Ex. 1.6j. 4. Ex. 1.14(b), p. 85. 5. Ex. 1.16(b), p. 85. 6. Prob. 1.31, p. 88. Explain in words how you would construct an NFA for
Background image of page 1

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

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

Page1 / 2

hw2 - 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