Let \(๐บ_1, ๐บ_2 \) be Context Free Grammars (CFGs) and \(๐‘…\) be a regularโ€ฆ

GATE ยท 2025 ยท CS ยท Set 2 ยท Computer Science & IT

Letย ๐บ1,๐บ2๐บ_1, ๐บ_2 be Context Free Grammars (CFGs) andย ๐‘…๐‘… be a regular expression. For a grammar GG, letย ๐ฟ(๐บ)๐ฟ(๐บ) denote the language generated by GG.

Which ONE among the following questions is decidable?

  1. A.

    Is๐ฟ(๐บ1)=๐ฟ(๐บ2)?Is ๐ฟ(๐บ_1) = ๐ฟ(๐บ_2)?

  2. B.

    Is๐ฟ(๐บ1)โˆฉ๐ฟ(๐บ2)=โˆ…?Is ๐ฟ(๐บ_1) โˆฉ ๐ฟ(๐บ_2) = โˆ…?

  3. C.

    Is๐ฟ(๐บ1)=๐ฟ(๐‘…)?Is ๐ฟ(๐บ_1) = ๐ฟ(๐‘…)?

  4. D.

    Is๐ฟ(๐บ1)=โˆ…?Is ๐ฟ(๐บ_1) = โˆ…?

Attempted by 142 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lessonโ€ฆ