Register

toc(undecidability)

582 views
0 0 votes
does intersection and complement problem of CSL language follow closure property?

 does intersection and complement problem of CSL language are decidable?

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · #Last month preparat...Next → · #madeeasy
← Previous in category · gate-2015 Arden's th...Next in category → · MadeEasy Test Series...
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.6k
1.6k views
jatin khachane 1 asked Jan 8, 2019
1,624 views
TOC(Undecidability)
L1 = { <M | M halts on $\epsilon$ }L2 = { <M | $\epsilon$ $\in$ L(M) }Which one is RE or not RE
2 2 votes
0 0 answers
2.1k
2.1k views
Ayush Upadhyaya asked Nov 23, 2018
2,113 views
TOC-Undecidability
Here is my analysis.P1: When we bound the number of steps a turing machine can tape, the total number of input possible that can be taken by such turing machine becomes f...
0 0 votes
0 0 answers
851
851 views
sidlewis asked Sep 8, 2018
851 views
TOC- Undecidability
0 0 votes
1 1 answer
402
402 views
ankith_mondal asked Nov 17, 2024
402 views
Decidability and Undecidability
helloo just got a qstn, is universality problem for cfl decidable or undecidable? in toc sir taught it is deccidable , but in the chart sir shown it was writen undecidabl...