Lecture 9_ Finite Automata (FA) introduction
Introduction of Finite Automata (FA). FA are also known as: Finite Machine (FM), Finite Automatic Machine (FAM), Finite State Machine (FSM)
A finite automaton has 5-tuple ,
Q: Number of States
qo: Initial State
F: Final State
∑: Letters in Alphabet
∂: Transitions / Movements
All five tuples of finite automata (FA) are described in this video with help of examples.
#sherurecords