PDA (Pushdown Automata)
- Pushdown Automata
- Pushdown Automata Acceptance by Final State
- Construct Pushdown Automata for given languages
- Construct Pushdown Automata for all length palindrome
- Detailed Study of PushDown Automata
- NPDA for accepting the language L = {an bm cn| m,n>=1}
- NPDA for accepting the language L = {an bn cm | m,n>=1}
- NPDA for accepting the language L = {anbn | n>=1}
- NPDA for accepting the language L = {am b(2m) | m>=1}
- NPDA for accepting the language L = {am bn cp dq| m+n=p+q ; m,n,p,q>=1}
- Construct Pushdown automata for L = {0n1m2m3n | m,n ? 0}
- Construct Pushdown automata for L = {0n1m2(n+m) | m,n ? 0}
- NPDA for accepting the language L = {ambnc(n+m) | m,n ? 1}
- NPDA for accepting the language L = {amb(n+m)cn| m,n ? 1}
- NPDA for accepting the language L = {a2mb3m | m ? 1}
- NPDA for accepting the language L = {amb(2m+1) | m ? 1}
- NPDA for accepting the language L = {aibjckdl | i==k or j==l,i>=1,j>=1}
- Construct Pushdown automata for L = {a(2*m)c(4*n)dnbm | m,n ? 0}
- Construct Pushdown automata for L = {0n1m2(n+m) | m,n ? 0}
- NPDA for L = {0i1j2k | i==j or j==k ; i , j , k >= 1}
- NPDA for accepting the language L = {anb(2n) | n>=1} U {anbn | n>=1}
- NPDA for the language L ={w?{a,b}*| w contains equal no. of a’s and b’s}
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