Fill This Form To Receive Instant Help
Homework answers / question archive / Homework #6: Chapter 3 Exercises: 3
Homework #6: Chapter 3
Exercises: 3.2: 1, 3, 6(a), 11, 12(c)
1) Use the construction in Theorem 3.1 to find an nfa that accepts the language L(a*a + ab).
2) Use the construction in Theorem 3.1 to find an nfa that accepts the language L(ab*aa + bba*ab).
6) Find dfa’s that accept the following language.
(a) **L(aa* + aba*b*)
Note: You need to build a NFA first and then convert it into DFA
11) What language is accepted by the following generalized transition graph?
a ®a a+b ®a+b a+b*
a*b+c
12) Find regular expressions for the languages accepted by the following automata.
(c) a ®b a b
b
Already member? Sign In