Theory of Computation 1 min read
Undecidable Languages
For an undecidable language, there is no Turing Machine which accepts the language and makes a decision for every input…
EXPLORE THE FIELD
Category: Theory of Computation.
Discover thoughtful articles, guides and ideas about this topic.
← Explore all topics Theory of Computation 2 min read
Linear Bounded Automata
A linear bounded automaton is a multi-track non-deterministic Turing machine with a tape of some bounded finite length. Length =…
Theory of Computation 2 min read
Semi-Infinite Tape Turing Machine
A Turing Machine with a semi-infinite tape has a left end but no right end. The left end is limited…
Theory of Computation 2 min read
Non-Deterministic Turing Machine
In a Non-Deterministic Turing Machine, for every state and symbol, there are a group of actions the TM can have.…
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…
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…