208 views
0 votes
0 votes

Consider the language L

Where the symbol refers to polynomial time reducible. Comment on the decidability of the above language?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
0 votes
0 votes
2 answers
3
jugnu1337 asked Sep 3, 2023
329 views
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to