Introduction to Finite State Machine(FSM) / Finite Automata(FA)
  • Introduction to Finite State Machine/ Finite Automata
  • Prerequisites of FSM/FA
  • Power and Cardinality of Alphabet Set
  • Tuple Definition of Deterministic Finite Automata
Construct DFA machine - Start with Substring pattern
  • Design DFA- Start with 'ba'
  • Design DFA-Start with '011'
Construct DFA machine - contain Substring pattern
  • Design DFA- contain a substring 'ab'
  • Design DFA - contain substring '110'
Construct DFA machine - end with Substring pattern
  • Design DFA - end with 'ab'
  • Design DFA- end with 'bab'