Turing Machine
- Turing Machine
- Turing Machine for addition
- Turing machine for subtraction | Set 1
- Turing machine for multiplication
- Turing machine for copying data
- Construct a Turing Machine for language L = {0n1n2n | n?1}
- Construct a Turing Machine for language L = {wwr | w ? {0, 1}}
- Construct a Turing Machine for language L = {ww | w ? {0,1}}
- Construct Turing machine for L = {anbma(n+m) | n,m?1}
- Construct a Turing machine for L = {aibjck | i*j = k; i, j, k ? 1}
- Turing machine for 1’s and 2’s complement
- Recursive and Recursive Enumerable Languages
- Turing Machine for subtraction | Set 2
- Halting Problem
- Theory of Computation | Applications of various Automata
- Turing Machine as Comparator
Automata Tutorial
Automata theory is a branch of the theory of computation. It deals with the study of abstract machines and their capacities for computation. An abstract machine is called the automata. It includes the design and analysis of automata, which are mathematical models that can perform computations on strings of symbols according to a set of rules.
Theory of computation is the branch of computer science that studies the nature and ranges of computation. It includes analysis and design of algorithms computation systems, formal languages, automata theory, compatibility theory, and complexity theory.
In this Automata Tutorial, you’ll learn all the basic to advanced topics like Regular languages and finite automata, Context free Grammar and Context-free language, turning machines, etc.
Table of Content
- Introduction
- Automata – Introduction
- Regular Expression and Finite Automata
- CFG (Context Free Grammar)
- PDA (Pushdown Automata)
- Turing Machine
- Decidability
- Quick Links