Theory of Computation 2 min read
Turing Machine
A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated by type 0 grammars. It…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
Theory of Computation 2 min read
Pumping Lemma for CFG
Lemma If L is a context-free language, there is a pumping length p such that any string w ∈ L of length ≥ p can be written as w = uvxyz,…
Theory of Computation 4 min read
CFG Simplification
In a CFG, it may happen that all the production rules and symbols are not needed for the derivation of…
Theory of Computation 2 min read
CFL Closure Property
Context-free languages are closed under − Union Concatenation Kleene Star operation Union Let L1 and L2 be two context free languages. Then L1 ∪ L2 is also…
Theory of Computation 2 min read
Difference between Pushdown Automata and Finite Automata
Pushdown Automata:A Pushdown automata (PDA) is a finite state machine with an added stack storage. Additional stack is used in…
Theory of Computation 3 min read
Pushdown Automata Acceptance by Final State
We have discussed Pushdown Automata (PDA) and its acceptance by empty stack article. Now, in this article, we will discuss how PDA…
Theory of Computation 4 min read
Construct Pushdown Automata for given languages
Prerequisite – Pushdown Automata, Pushdown Automata Acceptance by Final StateA push down automata is similar to deterministic finite automata except that it…
Theory of Computation 4 min read
Introduction of Pushdown Automata
We have already discussed finite automata. But finite automata can be used to accept only regular languages.Pushdown Automata is a finite…