Q3real09sol - CSE303 Q3 SOLUTIONS Summer 2009 YES/NO...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: CSE303 Q3 SOLUTIONS Summer 2009 YES/NO questions Circle the correct answer. Write SHORT justification. 1. For any language L * , 6 = there is a deterministic automata M , such that L = L ( M ). Justify : only when L is regular n 2. Any regular language has a finite representation. Justify : definition; regular expression is a finite string y 3. Any finite language is regular. Justify : any finite language is a finite union of one element regular languages y 4. Given L 1 ,L 2 languages over , then (( L 1 ( *- L 2 )) L 2 ) L 1 is regular. Justify : only when both are regular languages n 5. For any deterministic automata M , L ( M ) = S { R (1 ,j,n ) : q j F } , where R (1 ,j,n ) is the set of all strings in * that may drive M from state initial state to state q j without passing through any intermediate state numbered n +1 or greater, where n is the number of states of M . Justify : basic fact and definition y 6. in any Generalized Finite Automaton includes some regular ex- pressions. Justify : definition of GFA y 7. For any finite automata M , there is a regular expression r , such that L ( M ) = r . Justify : main theorem y 8. Pumping Lemma says that we can always prove that a language is not regular. Justify : PL gives a certain characterization of infinite regular lan- guages n 9. Pumping Lemma serves as a tool for proving that a language is not regular....
View Full Document

Page1 / 5

Q3real09sol - CSE303 Q3 SOLUTIONS Summer 2009 YES/NO...

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