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

  • Detlef Wotschke
Syntax Von Programmiersprachen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1)

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.

References

  1. /1/.
    Book, R.V. and Greibach, S.A., "Quasi-Realtime Languages", Mathematical Systems Theory, 4 (1970), 97–111.Google Scholar
  2. /2/.
    Chandler, W.J., "Abstract Families of Deterministic Languages", SDC Technical Report, TM-738/052/00, Santa Monica, California, (1969).Google Scholar
  3. /3/.
    Cole, S.N., "Deterministic Pushdown Store Machines and Real-Time Computation", JACM, 18 (1971), 306–328.Google Scholar
  4. /4/.
    Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, (1966).Google Scholar
  5. /5/.
    Ginsburg, S. and Greibach, S.A., "Deterministic Context-Free Languages", Information and Control, 9 (1966), 602–648.Google Scholar
  6. /6/.
    Greibach, S.A., "Jump PDA's, Deterministic Context-Free Languages, Principal AFDL's and Polynomial Time Recognition", Proceedings of Fifth Annual ACM Symposium on Theory of Computing, Austin, Texas, 1973, 20–28.Google Scholar
  7. /7/.
    Knuth, D.E., "On the Tranlation of Languages from Left to Right", Information and Control, 8 (1965), 607–639.Google Scholar
  8. /8/.
    Liu, L.Y. and Weiner, P., "An Infinite Hierarchy of Intersections of Context-Free Languages", Mathematical Systems Theory, 7 (1973).Google Scholar
  9. /9/.
    Wotschke, D., "A Characterisation of Boolean Closures of Families of Languages", will appear in Lecture Notes in Computer Science, Springer-Verlag, New York, (1973).Google Scholar

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • Detlef Wotschke

There are no affiliations available

Personalised recommendations