Register
Webpage for Theory of Computation:

Recent questions tagged theory-of-computation

0 votes
0 answers
92
10. 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+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9
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...
User Avatar
0 votes
0 answers
94
Theory of Computation
L = a^n / n is odd number is a Regular language but by checking it with pumping lemma it’s getting as Not Regular.why? https://gateoverflow.in/?qa=blob&qa_blobid=15872129177586526309
L = a^n / n is odd number is a Regular languagebut by checking it with pumping lemma it’s getting as Not Regular.why?https://gateoverflow.in/?qa=blob&qa_blobid=158721...
User Avatar
0 votes
1 answer
95
Internet
Consider the following language definition: L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ Σ L is A. Regular B. Context-free but not regular C. Recursive but not context-free D. Recursively enumerable but not recursive
Consider the following language definition:L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ ΣL isA. RegularB. Context-free but not regularC....
User Avatar
0 votes
1 answer
96
#Gate CS Applied Course
is this correct DFA ?
is this correct DFA ?
User Avatar
0 votes
1 answer
97
1 State DFA
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
User Avatar
1 votes
2 answers
101
physics wallah question
$L_1=a^ * b^ *$ $L_2=a^ + b^ +$ Find $L_2-L_1$: A. $a ^ *$ B. $b ^ *$ C. $a ^ * +b^ *$ D. None
$L_1=a^ * b^ *$$L_2=a^ + b^ +$Find $L_2-L_1$:A. $a ^ *$B. $b ^ *$C. $a ^ * +b^ *$D. None
User Avatar
0 votes
1 answer
102
made easy test series 2023 question
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following: Which one of them is correct ?
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following:Which one of them is correct ?
User Avatar
0 votes
1 answer
103
made easy test series 2023 toc question
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
User Avatar
0 votes
2 answers
104
Made Easy Book
114
114
User Avatar
0 votes
0 answers
105
TOC Decidibility
User Avatar
Page: