ling homework 178 10 - Homework #10: Regular expressions,...

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

View Full Document Right Arrow Icon
Sheet1 Page 1 Homework #10: Regular expressions, FSA and regular languages class on Thursday, May 1. You may draw the FSA by hand, but make sure they are legible. Note that honors students have a different assignment, see end of sheet. A. Regular expressions (24 points) Write regular expressions for the following cases. Make sure you account for all eventualities. Assume 1. Match the string flea 2. Match either the string flea or the string dog 3. Match either the string flea or either the string dog or cat 4. Match any string starting with d, then two symbols that can be anything, then another d 5. Match any string containing at least one a B. FSA (30 points) Write Finite State Automata for each of the six regular expressions under A. Assume that each transition input can only be one symbol (like a or b, not entire words). If you decide you need a symbol to dot, as that is more legible. C. Proof of equivalency (20 points)
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 05/11/2008 for the course INDV 101 taught by Professor Walker during the Spring '07 term at University of Arizona- Tucson.

Page1 / 2

ling homework 178 10 - Homework #10: Regular expressions,...

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