1,026 views
0 votes
0 votes
L= {<G> | G is CFG and G is NOT ambiguous} .
L is TM recognizable or not even TM recognizable?

1 Answer

0 votes
0 votes
as L is  CFG  it is subset of UG

that is TM recoznigable

Related questions

0 votes
0 votes
0 answers
3
Na462 asked Jan 21, 2019
716 views
0 votes
0 votes
0 answers
4
Ayush Upadhyaya asked Jan 13, 2019
407 views
From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$I was unable to get...