22.
State
f
Input
0
1
s 0
s 0, s 2
s 1
s 1
s 3
s 2
s 4
s 3
s 3
s 4
s 3
s 3
23. L
n
n n
n
=
≥
{ ,
,
|
}
0 0 010 11
0
24. (a) L = {0, 01, 11}
(b) L
m
n
m n
=
∪
≥
≥
{ , } {
|
,
}
λ 0
0 1
1
1
(c) L
n
n m
n
n
m
=
≥ ∪
≥
{ |
} {
| ,
}
10
0
10 10
0
25. (a) {0, 10, 11} {0, 1}
*
(b) (
|
}
0 1
0
1
m n m
n
≥
≥
and
26. (a)
312
Theory of Automata, Formal Languages and Computation
{,} ss 14
{,} ss 34
{} s 0
{,} ss 02
{} s 1
{} s 4
Start
{} s 3
0,1
0,1
0
1
1
0
1
1
{} s 0
φ
0,1
0
0
0
s 0
s 1
s 2
s 3
1
1
1
Start
0
0
0
0