The Boolean closures of the deterministic and nondeterministic context-free languages

  • Detlef Wotschke
Syntax Von Programmiersprachen

DOI: 10.1007/3-540-06473-7_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1)
Cite this paper as:
Wotschke D. (1973) The Boolean closures of the deterministic and nondeterministic context-free languages. In: von Brauer W. (eds) GI Gesellschaft für Informatik e. V. 3. Jahrestagung Hamburg, 8.–10. Oktober 1973. Lecture Notes in Computer Science, vol 1. Springer, Berlin, Heidelberg

Abstract

The Boolean closure of the deterministic context-free languages is properly contained in the intersection-closure of the context-free languages and the latter is properly contained in the Boolean closure of the context-free languages. The class of context-free languages and the Boolean closure of the deterministic context-free languages are incomparable in the sense that neither one is contained in the other. The intersection-closures of the deterministic and nondeterministic context-free languages are not principal AFDL's.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • Detlef Wotschke

There are no affiliations available

Personalised recommendations