Theory of Computation 1 min read
Multi-track Turing Machine
Multi-track Turing machines, a specific type of Multi-tape Turing machine, contain multiple tracks but just one tape head reads and…
THE LATEST THINKING
Every story.
Browse our articles in publication order, with new stories added automatically.
Theory of Computation 1 min read
Multi-tape Turing Machine
Multi-tape Turing Machines have multiple tapes where each tape is accessed with a separate head. Each head can move independently…
Theory of Computation 3 min read
Accepted Language & Decided Language
A TM accepts a language if it enters into a final state for any input string w. A language is…
Theory of Computation 3 min read
Pushdown Automata & Parsing
Parsing is used to derive a string using the production rules of a grammar. It is used to check the…
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…
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…
