Transition Table in theory of automata

By: Prof. Fazal Rehman Shamil | Whatsapp:+923028700085

What is transition table?

Transition table is a table in which we demonstrated the source states and end states after generating the transitions in a tabular form.

Example 1:

Built transition table for following FA?

FA in theory of automata

Transition Table:

Source State

Destination State

Read a

Read b

Start final Dead
Dead Dead Dead

 


Example 2:

Built transition table for following FA?

FA in theory of computation

FA in theory of computation

Transition Table:

Source State

Destination State

Read a

Read b

Start 2 3
2 end1 2
3 3 end2
end1 end1 end1
end2 3 end2

Video Lecture

List of 100+ Important Deterministic Finite Automata