Undecidable Languages
For an undecidable language, there is no Turing Machine which accepts the language and makes…
Theory of Computation
Theory of Computation
Linear Bounded Automata
A linear bounded automaton is a multi-track non-deterministic Turing machine with a tape of some…
Theory of Computation
Semi-Infinite Tape Turing Machine
A Turing Machine with a semi-infinite tape has a left end but no right end.…
Theory of Computation
Non-Deterministic Turing Machine
In a Non-Deterministic Turing Machine, for every state and symbol, there are a group of…
Theory of Computation
Multi-track Turing Machine
Multi-track Turing machines, a specific type of Multi-tape Turing machine, contain multiple tracks but just…
Theory of Computation
Multi-tape Turing Machine
Multi-tape Turing Machines have multiple tapes where each tape is accessed with a separate head.…
Theory of Computation
Accepted Language & Decided Language
A TM accepts a language if it enters into a final state for any input…
Theory of Computation
Pushdown Automata & Parsing
Parsing is used to derive a string using the production rules of a grammar. It…
Theory of Computation
Turing Machine
A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated…
Theory of Computation
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…