Theory of Automata & Computation Books
Recommended Books By Gate Vidyalay
|
Why You Should Read Book By Peter Linz?
Theory of Automata & Computation Books
Theory of Automata & Computation Notes
Deterministic Finite Automata-
- Construction of DFA | Type-01
- Construction of DFA | Type-02
- Minimization of DFA
- DFA to Regular Expression | State Elimination Method
- DFA to Regular Expression | Arden’s Theorem
Non-Deterministic Finite Automata-
Grammar Formalism-
- Parse Tree | Derivations
- Left Recursion | Elimination
- Types of Grammars
- Ambiguous & Unambiguous Grammar
- Recursive & Non-Recursive Grammar
Ambiguous Grammar-
- Ambiguous Vs Unambiguous Grammar
- Checking whether Grammar is Ambiguous
- Converting Ambiguous into Unambiguous Grammar
- Evaluating Expressions Based on Given Grammar
- Important Points for Exams
Language of Grammar-
Context Free Grammar-
Normal Forms-
Decision Algorithms of CFG-
- To decide whether CFL is empty or not
- To decide whether CFL is finite or not
- To decide membership of CFG | CKY Algorithm
More Articles Coming Soon…Subscribe To Receive Email Notifications!
