Theory of Computation
Non-Deterministic Turing Machine
In a Non-Deterministic Turing Machine, for every state and symbol, there are a group of actions the TM…
August 14, 2021 · Taylor EmmaAuthor: Taylor Emma
A senior editor for The Mars that left the company to join the team of SenseCentral as a news editor and content creator. An artist by nature who enjoys video games, guitars, action figures, cooking, painting, drawing and good music.
Theory of Computation
Multi-track Turing Machine
Multi-track Turing machines, a specific type of Multi-tape Turing machine, contain multiple tracks but just one tape head…
August 14, 2021 · Taylor EmmaTheory of Computation
Multi-tape Turing Machine
Multi-tape Turing Machines have multiple tapes where each tape is accessed with a separate head. Each head can…
August 14, 2021 · Taylor EmmaTheory of Computation
Accepted Language & Decided Language
A TM accepts a language if it enters into a final state for any input string w. A…
August 14, 2021 · Taylor EmmaTheory of Computation
Pushdown Automata & Parsing
Parsing is used to derive a string using the production rules of a grammar. It is used to…
August 14, 2021 · Taylor EmmaTheory of Computation
Turing Machine
A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated by type 0…
August 14, 2021 · Taylor EmmaTheory 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 be written as w…
August 14, 2021 · Taylor EmmaTheory of Computation
CFG Simplification
In a CFG, it may happen that all the production rules and symbols are not needed for the…
August 14, 2021 · Taylor EmmaTheory of Computation
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…
August 14, 2021 · Taylor EmmaTheory of Computation