-2

Is is decidable whether 2 given PDAs accept the same language?

Also, is it decidable whether the language accepted by a given grammar is context free (the given grammar could be unrestricted but there may exist an equivalent CFG for it)

Raphael
  • 73,212
  • 30
  • 182
  • 400
Anup Agarwal
  • 1
  • 1

1 Answers1

-1

These problems are undecidable. For more other problems, visit this page https://www.cs.wcupa.edu/rkline/fcs/grammar-undecidable.html

Devendra Bhave
  • 102
  • 7