aajhub
aajhub
aajhub
FLAT - Unit-I
- Automata theory and Finite Automation
- Equivalence of DFA and NFA
- Mealy and Moore Machines
- Design of DFA NFA
- Applications and Limitation of Finite Automata
aajhub
aajhub
aajhub
FLAT - Unit-II
- Regular Sets, Identity Rules
- Finite Automata and Regular Expressions
- Equivalence between FA and RE, RE and FA
- Pumping Lemma of Regular Sets
- Grammar, Chomsky Hierarchy Theorem
- Equivalence of two RL, Minimization of RES
aajhub
aajhub
aajhub
FLAT - Unit-III
- Ambiguous Grammars, Greibach Normal Form (GNF)
- Context-Free Grammar & CFG to CNF & CFG to GNF conversion
- Pumping Lemma, Applications of Context Free Grammars
- E Productions and Unit Productions
aajhub
aajhub
aajhub
FLAT - Unit-IV
- Application of Pushdown Automata
- Pushdown Automata & Design [imp]
- Context Free Grammar to Push Down Automata [imp]
- Construct the CFG for the PDA
- Compare and contrast PDA with two stack PDA
aajhub
aajhub
aajhub
FLAT - Unit-V
- Classes of P and NP, NP-Hard and NP-Complete Problems
- What is meant by Turing Reducibility?
- Turing Machine (Try to learn briefly)
- Halting Problem of TM, linear bounded automata
- Church's Hypothesis