This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Ch. 0.) You may give your answer descriptively, in plain English, but be sure that the main ideas come through clearly. 3. Let A LL DFA = {a A A A is a DFA and L ( A ) = Σ * } . Prove that A LL DFA is decidable. 4. Let A ε CFG = {a G A G is a CFG that generates ε } . Prove that A ε CFG is decidable. 5. Let A = {a R,S A R and S are regular expressions and L ( R ) ⊆ L ( S ) } . Prove that A is decidable. Spring 10: CSci 4011—Formal Languages and Automata Theory Homework Cover Page (Please fll in and staple to the Front oF your homework) Name (print): Student ID #: Homework #: Discussion Section registered for (check one): c Sec. 2 (11:15 a.m.–12:05 p.m.; ShengWen Wang) c Sec. 3 (12:20 p.m.–01:10 p.m.; Maitreyi Nanjanath) c Sec. 4 (10:10 a.m.–11:00 a.m.; ShengWen Wang)...
View
Full Document
 Spring '08
 NADATHUR
 Regular expression, Automata theory, lexicographic order, Languages and Automata Theory, CSci 4011—Formal Languages, ordinary TM

Click to edit the document details