Advertisement

Undecidable Problems About CFLs

  • Dexter C. Kozen
Part of the Undergraduate Texts in Computer Science book series (UTCS)

Abstract

In this lecture we show that a very simple problem about CFLs is undecidable, namely the problem of deciding whether a given CFG generates all strings.

Keywords

Turing Machine Simple Problem Finite Automaton Short String Start symbolS 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1977

Authors and Affiliations

  • Dexter C. Kozen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations