Assigment 1.
1. a. For the language I? {0, 1}*, find a regular expression representing the
following. You are required to provide the detailed steps or multiple cases
that you used to derive your final answer:
i. All strings that do not begin with 11.
ii. All strings in which every appearance of 0 is followed directly by a 1.
b. Convert the following non-deterministic finite automaton into regular
expression:
S
A
C
D
0,1
1
1
0
0
0
1
B
Hints: Consider the 3 routes that will be accepted by this NFA, write the
RE for each of the route.
Route 1: S
Route 2: S?A?C?D
Route 3: S?B?A?C?D
