search
Log In
0 votes
60 views

in Theory of Computation 60 views
0
i am getting both false.?
0
i am also getting both of them is false.

(1) there is a need of comparison between w1 and w2 (w1!=w2)

(2) in case of second statement there is a two path for a initially so it can't be DCFL.

Please log in or register to answer this question.

Related questions

2 votes
1 answer
1
395 views
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
asked Apr 30, 2019 in Theory of Computation srestha 395 views
0 votes
1 answer
2
315 views
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$
asked Apr 23, 2019 in Theory of Computation srestha 315 views
0 votes
3 answers
3
2.1k views
Consider $\left \langle M \right \rangle$ be the encoding of a turing machine as a string over alphabet $\Sigma =\left \{ 0,1 \right \}$. Consider $D=${$\left \langle M \right \rangle$ $M$ ... Recursive $(B)$ Non-Recursive $(C)$ Recursively enumerable $(D)$ Not Recursively enumerable My question is Is it not a Halting Problem they are asking for?
asked Apr 13, 2019 in Theory of Computation srestha 2.1k views
0 votes
0 answers
4
127 views
What is partial language?
asked Nov 21, 2018 in Theory of Computation amitqy 127 views
...