Register

toc(undecidability)

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

 does intersection and complement problem of CSL language are decidable?
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
jatin khachane 1 asked Jan 8, 2019
744 views
TOC(Undecidability)
L1 = { <M> | M halts on $\epsilon$ } L2 = { <M> | $\epsilon$ $\in$ L(M) } Which one is RE or not RE
L1 = { <M | M halts on $\epsilon$ }L2 = { <M | $\epsilon$ $\in$ L(M) }Which one is RE or not RE
User Avatar
0 votes
0 votes
0 answers
3
sidlewis asked Sep 8, 2018
442 views
TOC- Undecidability
User Avatar
0 votes
0 votes
0 answers
4
Sparsh-NJ asked Aug 6, 2023
235 views
Undecidability Doubt
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable? The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable . Help would be appreciated.
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable?The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable ...
User Avatar
Link Copied!