Recent questions tagged theory-of-computation

0 votes
1 answer
63
0 votes
1 answer
65
What is meaning of " L is recursively enumerable but not recursive " ?
0 votes
1 answer
67
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
1 votes
2 answers
68
Which of the following Language has Prefix property?A) L=01*B) L=0*1*c) L= {0" 1" | n>, 1}D) L= {WW | We(0+1)*}
0 votes
0 answers
69
0 votes
0 answers
70
Prove L = {F | F is a boolean formula and F evaluates to true on every asignment" is decidable (include algorithm and running time in big o notation)
0 votes
0 answers
71
1 votes
0 answers
73
Design the Push down Automata for the language L={anbmc2nd3m,n,m>=1}.Check the acceptance string by both the empty stack and final state method.
0 votes
2 answers
75
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
0 votes
0 answers
77
0 votes
1 answer
80
1 votes
1 answer
81
0 votes
0 answers
83
Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...