Example 4.2.1 Introduction to Finite-State Automata

PRACTICE EXERCISES

1. Consider the finite-state automaton M defined by the state diagram shown below:

a. What are the states (Q) of M?

b. What is the alphabet ( ) of M?

c. What is the start state of M?

d. What are the accept states (F) of M?

e. Find T(q2, 1).

f. Create the transition table of M.

            
2. Consider the finite-state automaton A defined by the following transition table.

a. What are the states (Q) of A?

b. What is  (the alphabet of A)?

c. What is the start state of A?

d. What are the accept states (F) of A?

e. Find T(q2, b).

f. Draw a state diagram for A.