CFG to GNF Conversion | Context Free Grammar to Greibach Normal Form Conversion | GATECS | TOC
Turing Machine for a^n b^n || TOC
Universal Turing Machine | Binary encoding of turing machine | GATECSE | TOC
Arden’s Theorem | Finite Automata to Regular Expression | GATECSE | TOC
Epsilon NFA to DFA Example 1 | epsilon NFA to DFA | TOC | Automata Theory
Arden's Theorem Examples 3 | Finite Automata to Regular Expression | GATECSE | TOC
S-Attributed and L-Attributed SDD | Types of SDD | Compiler Design
Simplification of Context Free Grammar ( Reduction of CFG) |Automata Theory
Chomsky Classification of Grammar || GATECSE || TOC
Pushdown Automata for a^n b^n c^m and a^n b^m c^n |Theory of Computation | TOC | Automata Theory
First and Follow in Compiler Design | Examples
Turing Machine for 1's complement | 2's complement | Turing Machine | Turing Machine as a Transducer
CFG to CNF Conversion Examples | Chomsky Normal Form Examples | TOC | Automata Theory
Introduction to Compiler Design | Language Processing System
Loop Optimization Techniques | Code Optimization | Compiler Design
Arden's Theorem Examples 2 | Finite Automata to Regular Expression | GATECSE | TOC
Introduction to Regular Expression | Regular Language to Regular Expression | Automata Theory
Introduction to Parser | Top Down and Bottom Up Parser | Compiler Design
Run Time Environment | Compiler Design
Chomsky Normal Form | CNF | CNF with examples | TOC | Automata Theory
Introduction to Mealy and Moore Machine | TOC | GATECSE
What is Grammar in TOC || GATECSE || TOC
Mergesort Algorithm (Part-1) | Merging | Merge Procedure | Sorting Algorithm | GATECSE | DAA
Turing Machine For Multiplication|TM for Multiply of two Number|Unary|Turing Machine| GATECSE | TOC
Basic Blocks and Flow Graphs | Code Optimization | Compiler Design
SLR (1) Parser Example 1 | Simple LR Parser | SLR Parsing Table Example | Compiler Design
How to check whether a language is cfl or not | CFL, DCFL and Non-CFL | GATECSE | TOC
Comparing of various functions to analyze time complexity | DAA
Pushdown Automata (PDA) for a^m+n b^n c^m | a^n b^m+n c^m | a^n b^m c^m+n | Automata Theory
Master's Theorem || Solving Recurrences || The Master's Methods || GATECSE || DAA
Mergesort Algorithm (Part-2) | | Divide and Conquer | Sorting Algorithm | GATECSE | DAA
Design DFA (length of the string is exactly 2 | at least 2 | at most 2) Example 1 | GATECSE | TOC
Variation of Turing Machine | Turing Machine | Automata Theory
Turing Machine for L= a^n b^n c^n || TOC
Design a DFA in which set of all strings can be accepted which ends with ab | TOC | Automata Theory
Liveness Analysis in Compiler Design | Code optimization | Dataflow analysis
Priority Queue Implementation Using Heap | Insertion and Deletion in Priority Queue | GATECSE | DAA
DFA of language with all strings starting with 'a' and ending with 'b' | TOC | GATECS
Introduction to Graph Theory | GATECSE | Graph Theory
Design a DFA in which set of all strings can be accepted which start with ab | TOC | Automata Theory
Two Dimensional Array || 2d Array || Data Structure
NFA to DFA Conversion Example 3 | Conversion from NFA to DFA Examples | TOC | Automata Theory
Recursive and Recursive Enumerable Languages in Theory of Computation | GATECSE | TOC
Asymptotic Notation Solved Examples Part-1 || GATE Solved Examples || GATECSE || DAA
Basic Blocks and Flow Graphs with GATE 2015 Example | Code Optimization | Compiler Design
Hash function in hashing | Types of Hash Function | Hashing | Data Structures
Small o Notation | Asymptotic Notation | GATECSE | DAA
PDA for L= a^n b^n UNION a^n b^2n | L= a^n b^n UNION a^n b^2n | Theory of Computation
DFA that accepts strings containing "ab" as a substring | DFA Design| TOC | Automata Theory
Handshaking Theorem | Sum of Degrees of Vertices Theorem | GATECSE | Graph Theory
Lexical Analyzer | Lexical Analysis | Compiler Design
LL(1) parser | Example 2 | Top Down Parser | Compiler Design
Bubble Sort Algorithm with Code and Time Complexity | Sorting Techniques | GATECSE | Data Structure
How to Check a Grammar is LL(1) or not | Compiler Design
Introduction to DFA | Deterministic Finite Automata | TOC | Automata Theory
Theta Notation | Asymptotic Notation | GATECSE | DAA
Greibach Normal Form (GNF) | GNF Solved Examples | TOC | GATECS | Automata Theory
Two Stack PDA | 2 stack PDA for a^n b^n c^n | TOC | Automata Theory
Introduction to Theory of Computation || GATECSE || TOC
Design DFA in which no of a's is multiple of 3 and no of b's is multiple of 2 | TOC | Automata
