FORMAL LANGUAGES AND AUTOMATA THEORY

  1. Syllabus
  2. Chapter 1
    • Introduction
    • Fundamental Concepts
    • Deterministic & Nondeterministic Finite Automata
    • NFA=DFA
    • NFA with e-moves & conversion of NFA with e-moves to NFA without e-moves
    • Finite state machines with outputs(Moore & Mealy Machines)
    • Equivalence of Moore and Mealy Machines
    • Converting NFA to regular expression
    • Converting regular expression to NFA
    • Minimisation of DFA
  3. Chapter 2 Regular Expressions