(b) (
)
(
) ( )
( )
*
*
*
*
aabb
b bab ba b ab
+
+
(c) a ba
*
*
10.
11.
State
g
h
Input
Input
s 0
s 1
s 3
1
0
s 1
s 1
s 2
1
1
s 2
s 3
s 4
0
0
s 3
s 1
s 0
0
0
s 4
s 3
s 4
0
0
12.
14. (a) 1100
(b) 00110110
(c) 11111111111
15.
310
Theory of Automata, Formal Languages and Computation
s 0
s 1
s 2
s 3
1,1
0,1
0,0
1,0
1,0
Start
0,0
1,1
s 0
s 1
s 2
Start
0,0
1,0
0,0
0,0
1,0
1,1
)
(
) ( )
( )
*
*
*
*
aabb
b bab ba b ab
+
+
(c) a ba
*
*
10.
11.
State
g
h
Input
Input
s 0
s 1
s 3
1
0
s 1
s 1
s 2
1
1
s 2
s 3
s 4
0
0
s 3
s 1
s 0
0
0
s 4
s 3
s 4
0
0
12.
14. (a) 1100
(b) 00110110
(c) 11111111111
15.
310
Theory of Automata, Formal Languages and Computation
s 0
s 1
s 2
s 3
1,1
0,1
0,0
1,0
1,0
Start
0,0
1,1
s 0
s 1
s 2
Start
0,0
1,0
0,0
0,0
1,0
1,1
