This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE303 Q2 SOLUTIONS Summer 2009 PART 1: YES/NO QUESTIONS Circle the correct answer. Write SHORT justification. Answers without justification will not receive credit. 1. The set F of final states of any deterministic finite automaton is al ways nonempty. Justify : the definition says that F is a finite set, i.e. can be empty, hence for some M . L ( M ) = . n 2. Alphabet of any deterministic, or nondeterministic finite automa ton is always nonempty. Justify : the definition says that is an alphabet, what means that is a finite set, i.e. can be empty, hence for some M . L ( M ) = . n 3. A configuration of a deterministic finite automaton M = ( K, ,,s,F ) is any element of K * K . Justify : a configuration is an element of K * . n 4. Given a nondeterministic automaton M = ( K, , ,s,F ) as defined in the book, a binary relation M ( K * ) ( K * ) is a one step computation iff the following condition holds ( q,aw ) M ( q ,w ) iff ( q,a,q ) and a { e } ....
View
Full
Document
This note was uploaded on 06/03/2011 for the course CSE 303 taught by Professor Ko,k during the Spring '08 term at SUNY Stony Brook.
 Spring '08
 Ko,K

Click to edit the document details