Fundamentals : Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and Language recognizers.

FSM EQUIVALANCE

equivalance of two final state machines

FLAT - Mealy and Moore Machines Problems with solutions

conversion from nfa to dfa

language of DFA and example probelms

fundamentals of automata theory