Hardware Reference
In-Depth Information
24
m
5
m
4
23
c
3
m
6
c
2
04
20
c
3
c
1
c
4
c
3
m
1
c
7
m
5
c
2
34
14
00
22
c
7
c
5
m
5
44
33
03
m
6
c
1
m
5
c
4
33
00
13
m
6
c
7
33
10
...
Fig. 15.8
(Fragment of the) Automaton of the maze for cat and mouse from Example
15.22
• Delete all transitions to a state that has been deleted.
• Delete all states unreachable from the initial state and all states that are not co-
reachable, i.e., from which an accepting state cannot be reached.
In our case the following steps are needed to reach a fixed point:
1. Step 1: Delete the state (1,3), because its uncontrollable transition under
c
7
to (3,3) must be deleted (since (3,3) was deleted), and all transitions from it;
Search WWH ::
Custom Search