saw this somewhere, therefore confused..

The Gateway to Computer Science Excellence

+1 vote

Equality and completeness problem for DCFL: Decidable

Equality and completeness problem for CFL: undecidable

https://gatecse.in/grammar-decidable-and-undecidable-problems/

Equality and completeness problem for CFL: undecidable

https://gatecse.in/grammar-decidable-and-undecidable-problems/

0

I suppose equality and completeness problem is drawn wrong.

DO you know, about:

Is intersection of languages of same type decidable/ undecidable in CFL, CSL, RL, and REL?

I read somewhere that everything for REL is undecidable but then read that 'Is intersection of languages of same type' is Decidable for REL?

DO you know, about:

Is intersection of languages of same type decidable/ undecidable in CFL, CSL, RL, and REL?

I read somewhere that everything for REL is undecidable but then read that 'Is intersection of languages of same type' is Decidable for REL?

0

Intersection of languages of same types is decidable only for regular languages. And for all others(dcfl,cfl,csl,rl,rel) it is undecidable..

+1

I read it from r-b-r lectures..i don't have any solid reference..

I get confused if i merge the concept of decidability along with closure property ((for proving anything))...

It's interesting--

https://gateoverflow.in/196555/intersection-recursive-languages-decidable-undecidable

https://gateoverflow.in/137855/cfl-decidability?show=140819#c140819

A chart for decidability https://gatecse.in/grammar-decidable-and-undecidable-problems/

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,370 answers

198,506 comments

105,272 users