Theory of Computation (CMPS 346)

Homework #4

Problem 1:

Show that B is regular. (Hint: Working with B R is easier. You

may assume the result claimed in homework 4 (exercise 4)

Problem 2:
Convert the following regular expressions to nondeterministic finite automata
1) a(bc)*
2) (aa∪b)*
3) a(abb)* ∪ b
4) (1∪0)*1
5) (00∪1)* 1 (0∪1)

Problem 3:

Convert the following DFAs into regular expressions.