2,108 views
0 votes
0 votes

Please log in or register to answer this question.

Related questions

118
views
0 answers
0 votes
RahulVerma3 asked Apr 2
118 views
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape
311
views
0 answers
0 votes
Picturesque asked Oct 31, 2023
311 views
The state diagram for the initial part of this turing machine given as:Here, we are basically traversing through the input tape, changing occurence of 'a' to X1, ... and directly looping back to 'q0' Please shed some light on it, thanks!
853
views
2 answers
3 votes
h4kr asked Dec 7, 2022
853 views
I saw question where I saw this format being used:L1 = {<M> | L(M) = ϕ}What does exactly <M> mean and why is L(M) = ϕ, mentioned afterwards. ... ? If the language is equivalent to null, it contains nothing. Then what does it exactly mean?
959
views
1 answers
3 votes