In 2—7, a finite-state automaton is given by a transition diagram. For each automaton:
a. Find its states.
b. Find its input symbols.
C. Find its initial state.
d. Find its accepting states.
e. Write its annotated next-state table.
4.
(a)
To find:
The states of given finite-state automation.
Given information:
A finite-state automation is given by a transition diagram as shown below.
Calculation:
The states are written in circle...
(b)
To find:
The input symbols of given finite-state automation.
(c)
To find:
The initial states of given finite-state automation.
(d)
To find:
The accepting states of given finite-state automation.
(e)
To write:
The annotated next-state table of given finite-state automation.