Register
Filter

Questions by thor

0 votes
0 answers
182
TOC - ME
0 votes
0 answers
186
ACE test series
4 votes
2 answers
187
What is the difference ??
Please explain clearly?
Please explain clearly?
0 votes
0 answers
188
Decidablility
@Arjun sir please explain?
@Arjun sir please explain?
4 votes
1 answer
189
Rice theorem
s Rice theorem says any non-trivial property of a language is Undecidable. Then how is above one REL. Does it mean we cannot say anything for a trivial property?
sRice theorem says any non-trivial property of a language is Undecidable. Then how is above one REL.Does it mean we cannot say anything for a trivial property?
2 votes
1 answer
190
Testseries question
0 votes
0 answers
191
Doubt TOC
I am reading https://docs.google.com/document/d/1F-JmRacHLMgszvfqmvR8PiEsSxhLXNdy2p8GTn7gUZI/edit I have a doubt understand this. L={<M,w>| M enter state q on input w}. Suppose M = $0001110$ and enters state $q$ in string $aab$ and another $M = 110 0 1 1$ which enters state $q$ on $babab$. What is $L$ here.
I am reading https://docs.google.com/document/d/1F-JmRacHLMgszvfqmvR8PiEsSxhLXNdy2p8GTn7gUZI/editI have a doubt understand this.L={<M,w>| M enter state q on input w}.Sup...
5 votes
1 answer
192
Decidability
Is there any proof for these or i have to remember these statements: 1. For a decidable language L, $L^r$ may be decidable or may not be. 2. Union of a decidable and Undecidable language can be decidable & even regular. 3. If every subset of a set is CFL, then the set must be regular.
Is there any proof for these or i have to remember these statements:1. For a decidable language L, $L^r$ may be decidable or may not be.2. Union of a decidable and Undeci...
1 votes
1 answer
194
Find regular exp. for the grammar?
I think it should be (a*+b*)ab*
I think it should be (a*+b*)ab*
0 votes
1 answer
195
True/False
1. Every TM can be converted to another TM with 2 states. 2. Every TM can be converted to another TM with 3 states. 3. Every TM can be converted to another TM with 1 state. Which of above are true??
1. Every TM can be converted to another TM with 2 states.2. Every TM can be converted to another TM with 3 states.3. Every TM can be converted to another TM with 1 state....
1 votes
2 answers
196
Number of states
Find the number of states in minimal dfa, $w \in${0,1}, such that when interpreted in binary is divisible by $11$. I think answer would be $5$. log2(11)
Find the number of states in minimal dfa, $w \in${0,1}, such that when interpreted in binary is divisible by $11$.I think answer would be $5$. log2(11)
3 votes
3 answers
198
Is there SR conflict in SLR(1) ?
0 votes
2 answers
199
ME = Compiler
Whether Grammar $S \rightarrow SS/ab$ ambiguous ? Please derive some strings?
Whether Grammar $S \rightarrow SS/ab$ ambiguous ? Please derive some strings?
2 votes
2 answers
200
ME - CD
Page: