This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 3 CISC 303 Timo Kötzing ([email protected]) Handed out: Friday, February 27. Due Date: Friday, March 6. Problem 1. (8 points) Let A = { a } be our alphabet. (i) Give an NFA M in graphical notation only such that L ( M ) = { w   w  is divisible by 3 or by 5 } . (ii) Convert your NFA from (i) into a DFA by using the multistatemachine construction . Make sure to give inter mediate steps. Problem 2. (8 points) Let A = { a,b } be our alphabet. (i) Give an εNFA M in graphical notation only such that L ( M ) = { a n  n ≥ } ∪ { ( ba ) n  n ≥ } . (ii) Convert your εNFA from (i) into an NFA using the algorithm from class. Make sure to give intermediate steps. (iii) Convert your NFA from (ii) into a DFA using the algorithm from class (multistatemachine). Make sure to give intermediate steps. Problem 3. (8 points) Let L ⊆ A * be any language. Two strings v,w ∈ A * are called Lequivalent (written v ≡ L w ), i ∀ u ∈ A * : vu ∈ L ⇔ wu ∈ L. (1) (a) Prove that...
View
Full
Document
This note was uploaded on 02/01/2012 for the course CISC 303 taught by Professor Carberry,m during the Spring '08 term at University of Delaware.
 Spring '08
 Carberry,M

Click to edit the document details