Professional Documents
Culture Documents
Chapter 3.2
Chapter 3.2
Chapter 3.2
Chapter 3.2
# 0 1 0 10 # a a a # b a #
...
M = {0, 1, a, b, } S = {0, 1, a, b, , #, 0, 1, a, b, }
Chapter 3.2
. .
...
# 0 1 0 10
# a a a # b a #
...
Chapter 3.2
Chapter 3.2
Chapter 3.2
N N
13
N N
31
N
32
11
12
21
Why not search depth-rst? Must execute each machine, adding one step at a time.
Chapter 3.2
... D
q4
0 0 1 0
... D
q7
0 0 1 0
... D
q1
0 0 1 0
...
0 0 1 0 1 3 ...
# 0 1 0 1 3 ...
# # 1 0 1 3 ...
0 0 1 0 2 1 ...
Chapter 3.2
10
Chapter 3.2
12
aa baba abba
Chapter 3.2
13
s2 s2 , s5 s2 , s3 , s5 s2 , s3 , s5 s1 , s2 , s3 , s5 ...
If M accepts some string, it will eventually get printed out. Why are we running M this way?
Chapter 3.2
16
Chapter 3.2
18