TOC
Turing machine for a^nb^nc^n
In this turing machine number of a that equal to the number of b and c .pda cannot do this because in pda only one comparision is possible using st…
Read more
TOC
Regular expression (b(a+b)*) accept by dfa C code
Regular expression (b(a+b)*) accept by dfa C code #include<stdio.h> #include<string.h> int dfa=0; char item; void trasition0(char c) { …
Read more
TOC
Dfa that accept regular expression (a*b) C code
Dfa that accept regular expression (a*b) C code String accepted by language ={b,ab,aab,aaab,aaaab..................} #include<stdio.h> #inclu…
Read more
TOC
Dfa that accept a regular expression (a+ ) C code
Dfa that accept a regular expression (a+ ) C code Regular expression=a+ String accepted by regular expression ={a,aa,aaa,aaaa,aaaaa,aaaaaa,aaaaa…
Read more
TOC
Dfa that accept a regular expression (aa*b ) C code
Dfa that accept a regular expression (aa*b ) C code Regular expression=aa*b String accepted by regular expression ={ab,aab,aaab,aaaab,aaaaab....…
Read more
TOC
Dfa that accepts string on {0,1} if and only if the value of string interpreted as a binary representation of an integer is divisible by 2 C code.
Dfa that accepts string on {0,1} if and only if the value of string interpreted as a binary representation of an integer is divisible by 2 C code. …
Read more
TOC
2PDA that accept a language {L=a^nb^nc^n where n>0}C code
2PDA that accept a language {L=a^nb^nc^n where n>0}C code L=a^nb^nc^n String accepted by this language is =[abc,aabbcc,aaabbbccc,aaaabbbbcccc...…
Read more
TOC
Pushdown automata(pda) that accept a language a^nb^2n(L=a^nb^2n where n>0) c code
Pushdown automata(pda) that accept a language a^nb^2n(L=a^nb^2n where n>0) c code L={a^nb^2n where n>0} String accept by language ={abb,aabb…
Read more
TOC
Pushdownautomata(PDA) that accept a language L={WcW^r)where W={a,b} C code
Pushdownautomata(PDA) that accept a language L={WcW^r)where W={a,b} C code String accepted by language L={WcW^r)where W={a,b} ={abcba,aca,bca,bcb,b…
Read more
TOC
Pushdown automata(PDA) that accept language L={a^nb^m|n,m>0 and n!=m}
Pushdown automata(PDA) that accept language L={a^nb^m|n,m>0 and n!=m} String accepted by language ={abbb,aaab,aaaab,aaab........................…
Read more
TOC
C code of DFA that accept a string that end with 1.
C code of DFA that accept a string that end with 1. #include<stdio.h> #include<string.h> int dfa=0; void trasition0(char c) { if(c==&#…
Read more
TOC
C code of DFA that accept a string that have start with 1.
C code of DFA that accept a string that have start with 1. #include<stdio.h> #include<string.h> int dfa=0; void trasition0(char c) { i…
Read more
TOC
C code of DFA that accept a string that have consecutive 11 as substring.
Deterministic finite automata(DFA) simulation in C code C code of DFA that accept a string that have consecutive 11 as substring. #include<stdio…
Read more
TOC
Deterministic finite automata(DFA) simulation in C code(C code of DFA that accept a string that have atleast one 1 )
Deterministic finite automata(DFA) simulation in C code C code of DFA that accept a string that have atleast one 1 . #include<stdio.h> #includ…
Read more
TOC
Rice Theorem in Theory of computation
Rice Theorem in Theory of computation Any non-trivial property of the language recognizable by a turing machine is undecidable. Property of a langu…
Read more
TOC
Modification of Turing Machine
Modification of Turing Machine Simple Turing machine has recognization and computability capability.Simple turing machine use read and write tape i…
Read more
TOC
Decidability and Undecidability
Decidability and Undecidability Decidability It is also known as solvability and tractable problems.if problem have a solution then this is solvabl…
Read more
TOC
Normal form for context free grammar AND CNF and GNF
Normal form for CFG Restrict the right hand side of the production rules in different manner this result into different normal form.if CFG and prod…
Read more
TOC
Post correspondence problem(pcp) undecidable problem of Turing Machine
Post Correspondance Problem Post Correspondance Problem is a combinatorial problem formulated by Emil Post in 1946. A correspondance system P is a fi…
Read more
TOC
Chomsky hierarchy
Chomsky Hierarchy Noam Chomsky has classified all grammars in four categories Type 0.(phrase structured grammars). Type 1.(Context sensitive gramma…
Read more
Social Plugin