TCS - Chapter 1: Basic Concepts and Finite Automata
Module 1.0: Basic Concepts and Finite Automata (Total Theory Hours: 09)
Unit 1.1
[] Importance of TCS
[] Alphabets
[] Strings
[] Languages
[] Closure Properties
[] Finite Automata (FA)
[] Finite State Machine (FSM)
Unit 1.2
[] Definition of Deterministic Finite Automata (DFA)
[] Definition of Nondeterministic Finite Automata (NFA)
[] Transition diagrams of DFA and NFA
[] Language recognizers using DFA and NFA
[] Equivalence between NFA with and without epsilon-transitions
[] NFA to DFA conversion
[] Minimization of DFA
[] FSM with output: Moore machine
[] FSM with output: Mealy machine
[] Applications of Finite Automata
[] Limitations of Finite Automata