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

cse regular paper-flat

equivalance of two final state machines

melay and moore machine

conversion from nfa to dfa

language of DFA and example probelms

fundamentals of automata theory