retagged by
249 views
0 votes
0 votes

retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
RahulVerma3 asked Apr 2
46 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
0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
155 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.