Introduction to Automata
Introduction to automata theory and Formal Languages
Finite automata
Deterministic finite state automaton (DFA)
Sets
Relations and Functions
Asymptotic Behavior of Functions
Grammar
Graphs
Languages
Nondeterministic finite automaton
Strings and Languages
Boolean Logic
Orders for Strings
Operations on languages
Kleene Star, ‘∗’
Homomorphism
Machines
The power of DFAs
Machine types that accept nonregular languages
Equivalence of NFA and DFA
Regular Expressions
Regular Expressions and Languages
Building Regular Expressions
NFAs to Regular Expression
Twoway Finite Automata
Finite Automata with Output
Properties of regular sets (Languages)
Pumping Lemma
Closure properties of regular languages
MyhillNerode Theorem1
Exampleof Non Deterministic Finite Automata
Conversion of NFA to DFA
Mealy and moore Machine
MyhillNerode theorem
Decision algorithms
NFA with εmoves
Context free languages & grammar
Introduction to ContextFree Grammars
Conversion of Leftlinear Grammar into RightLinear Grammar
Derivation Tree
Parsing
Ambiguity
Simplification of CFG
Normal Forms
Greibach Normal Form
Pushdown Automata
Transition Functions for NPDA
Errorcorrecting DFAs
Execution of NPDA
Relation between pda and context free language
CFG to NPDA
NPDA to CFG
Properties of contextfree languages
Proof of Pumping Lemma
Usage of Pumping Lemma
dicision Algorithms
Binary Relation Basics
Transitive, and Related Notions
Equivalence (Preorder plus Symmetry)
The Power Relation between Machines
Ultimate Periodicity and DFAs
A Taxonomy of Formal Languages and Machines
Introduction to Pushdown Automata
Right and LeftLinear CFGs
Developing CFGs
A Pumping Lemma for CFLs
A Pumping Lemma for CFLs
Fixed point logic Unit
Dealing with Recursion
The Y operator
The least fixedpoint
The Automaton/Logic Connection
Binary Decision Diagrams (BDDs)
Basic Operations on BDDs
Stabilization at a FixedPoint
Automata and Logic
Logical inference
The chomsky hirarchy
Unrestricted grammar
Context sensitive grammar and languages
Introduction to Complexity Theory
polynomial time algorithm
boolean satisfiablity
Additional NP problem
Formal systems
Composition and recursion
Ackermann's theorem
Propositions
Connectives
Tautology, Contradiction and Contingency
Logical Identities
Predicates and quantifiers
Quantifiers and logical operators
Normal forms
Temporal logic
Turing Machine
Programming a Turing Machine
Turing Machines as Transducers
Complete language and functions
Modification of turing machines
Churchturing thesis
Enumerating Strings in a Language
Halting Problem
Rice's Theorem
Acceptance, Halting, Rejection
NDTMs
Simulations of turing machine
Basic Undecidability Proofs
Rice’s Theorem
Greibach’s Theorem
Post’s correspondence problem (PCP)
PCP is undecidable
Proof sketch of the undecidability of PCP
Basic Notions in Logic including SAT
Axiomatization of Propositional Logic
Firstorder Logic (FOL) and Validity
Examples of interpretations
Validity of firstorder logic is undecidable
Properties of Boolean Formulas
Overview of direct DNF to CNF conversion
CNFconversion using gates
DIMACS file encoding
Unsatisfiable CNF instances
3CNF, =satisfiability, and general CNF
2CNF satisfiability
DFA for Presburger Arithmetic
Presburger Formulas and DFAs
Encoding conventions
Conversion algorithm: Presburger formulas to automata
Pitfalls to Avoid
An Introduction to Model Checking
Reactive Computing Systems
Model checking vs. testing
Buchi automata, and Verifying Safety and Liveness
Dining Philosophers
Model (proctype) and property (never) automata
Temporal Logics
Computations vs. computation trees
Temporal formulas are Kripke structure classifiers
LTL vs. CTL through an example
LTL syntax
CTL syntax
Branch :
Computer Science and Engineering

Subject :
Automata
Fixed point logic Unit
Dealing with Recursion
Read topic
The Y operator
Read topic
The least fixedpoint
Read topic
The Automaton/Logic Connection
Read topic
Binary Decision Diagrams (BDDs)
Read topic
Basic Operations on BDDs
Read topic
Stabilization at a FixedPoint
Read topic