Skip to main content
SpringerLink
Log in

The centers of context-sensitive languages

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alt H. and K. Mehlhorn, A language over a one symbol alphabet requiring only O(log log n) space, SIGACT News, Vol. 7 (1975).

    Google Scholar 

  2. Arnold A., Topological characterizations of infinite behaviours of transition systems, Proc. 10th ICALP, In: LNCS 154, Springer-Verlag, Berlin 1983, 28–38.

    Google Scholar 

  3. Boasson L. and M. Nivat, Centers of languages, in: Theoretical Computer Sci. (P. Deussen ed.), LNCS 104, Springer-Verlag, Berlin 1981, 245–251.

    Google Scholar 

  4. Cohen R.S. and A.Y. Gold, ω-computations on Turing machines, Theoret. Comput. Sci. 6 (1978), 1–23.

    Google Scholar 

  5. Cohen R.S. and A.Y. Gold, ω-computations on deterministic push down machines, J. Comput. System Sci. 16 (1978), 275–300.

    Google Scholar 

  6. Linna, M., On ω-sets associated with context-free languages, Inform. Control 31 (1976), 272–293.

    Google Scholar 

  7. Nivat M., On the synchronisation of processes, Sem. d. Informatique Theor. du LITP, Ann. 1978–79, Univ. Paris 7.

    Google Scholar 

  8. Nivat M., Sur les ensembles de mots infinis engendres par une grammaire algebrique, RAIRO Inf. Theor. 12 (1978), 259–278.

    Google Scholar 

  9. Prodinger M. and F. J. Urbanek, Language operators related to Init. Theoret. Comput. Sci. 8 (1979), 161–165.

    Google Scholar 

  10. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw Hill, New York 1967.

    Google Scholar 

  11. Stearns R.E., Hartmanis J. and P. M. Lewis, Hierarchies of memory limited computations, IEEE Conf. Rec. Switching Circuit Theory and Logic. Design, New York 1965, 179–199.

    Google Scholar 

  12. Staiger L., Hierarchies of recursive ω-languages, EIK — J. Inform. Proc. and Cybernetics 22 (1986), 219–241.

    Google Scholar 

  13. Staiger L., ω-computations on Turing machines and the accepted languages, in: Theory of Algorithms, L. Lovász and E. Szemerédi eds., Coll. Math. Soc. János Bólyai No. 44, Budapest 1986, 393–403.

    Google Scholar 

  14. Staiger L. and K. Wagner, Rekursive Folgenmengen I. Z.Math. Logik Grundlag. Math. 24 (1978), 523–538.

    Google Scholar 

  15. Wagner K. and G. Wechsung, Computational Complexity, Deutscher Verlag d. Wiss., Berlin 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zentralinstitut für Kybernetik und Informationsprozesse, Akademie der Wissenschaften der DDR, PSF 1298, DDR-1086, Berlin

    Ludwig Staiger

  2. Karl-Weierstraß-Institut für Mathematik, Akademie der Wissenschaften der DDR, PSF 1304, DDR-1086, Berlin

    Werner Nehrlich

Authors
  1. Ludwig Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Nehrlich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Staiger, L., Nehrlich, W. (1986). The centers of context-sensitive languages. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016286

Download citation

  • DOI: https://doi.org/10.1007/BFb0016286

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation