This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 105: Introduction to the Theory of Comptuation Fall 2010 Problem Set 2 Instructor: Daniele Micciancio Due on: Wed. Oct 13, 2010 Guidelines: Same as for homework 1. Solutions to the homework should be submitted electronically using turnin, and you should submit a single pdf file together with 3 jflap files (1a.jff,1b.jff,3.jff), all zipped together. Problem 1 (6 points) Transform the following regular expressions into equivalent NFAs using the procedure studied in class (also described in the textbook). You can simplify your answer to some extent (e.g., by omitting some redundant - transitions), but your NFAs should have a structure that closely correspond to the given regular expressions. Draw the NFAs using jflap and submit your solutions as 1a.jff and 1b.jff. 1. ((0 * 1 * ) * 01) + 10(0 + 1) * 2. 1(11) * + (00) * Problem 2 (8 points) Consider the Very Simple Automata (VSA) as defined in homework 1. (Please refer to the definition of VSA in the posted solutions, rather than your own solutions to hw1.) In this problem you are asked to prove that VSA are not more powerful than regular DFA, i.e., any problem that can be solved using a VSA can also be solved using a DFA. This is intuitively obvious, as VSAs seem simpler than DFA, but we want to rigorously prove that this intuition is correct. Specifically, as part of your solution, you should give the mathematicalprove that this intuition is correct....
View Full Document
- Fall '99
- Formal language, Regular expression, Regular language, Nondeterministic finite state machine, Automata theory