Showing posts with the label TOCShow all
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
Social Plugin