Compiler construction I

Excercise sheet 3

1. What languages do the regular expressions assigned to r represent in the following

examples?
1. r → ab*a
2. r → b(aba)*b
3. a → 0*
b → 1+
r → ab*
4. d → 0 | 1| 2 | 3 | 4 | 5| | 6 | 7 | 8 | 9

2. Create a nondeterministic finite state automaton that accepts the language

L={w∈{0,1 }∗∣w contains 101 as substring } .
3. Create a deterministic finite state automaton that accepts the language
L={w∈{0,1 }∗∣w contains 101as substring } .