Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1979: Mathematical Foundations of Computer Science 1979 pp 266–276Cite as

An algebraic extension of the Chomsky — hierarchy

  • Communications
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. BOASSON, B., COURCELLE, B., NIVAT, M., A new complexity measure for languages, Proc. conference on Theoretical Computer Science, University of Waterloo, 1977.

    Google Scholar 

  2. DAMM, W., Languages defined by higher type program schemes, Proc. 4th international colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 52 (1977),pp. 164–179, Springer Verlag.

    Google Scholar 

  3. DAMM, W., The IO and OI hierarchies, Schriften zur Informatik und Angewandten Mathematik, 41, RWTH Aachen (1978).

    Google Scholar 

  4. DAMM, W., Dissertation at the RWTH Aachen (1979), to appear.

    Google Scholar 

  5. DAMM, W., FEHR, E., On the Power of Self-Application and Higher Type Recursion, Proc. 5th international colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 62 (1978), Springer Verlag, pp. 177–191.

    Google Scholar 

  6. DAMM, W., FEHR, E., INDERMARK, K., Higher type recursion and self-application as control structures, Formal Description of Programming Concepts, ed. E. Neuhold, North-Holland Publishing Company (1978), pp. 461–487.

    Google Scholar 

  7. ENGELFRIET, J., SCHMIDT E.M., IO and OI,part I and II, Journal of Computer and System Sciences Vol. 15, 3 (1977), pp. 328–352, and Vol. 16, 1 (1978), pp. 67–99.

    Google Scholar 

  8. FEHR, E., On typed and untyped λ-schemes, Schriften zur Informatik und Angewandten Mathematik 44, RWTH Aachen (1978).

    Google Scholar 

  9. FISCHER, M.J., Grammars with macro-like productions, Proc. 9th IEEE conference on Switching and Automata Theory (1968), pp. 131–142.

    Google Scholar 

  10. GOGUEN, J.A., THATCHER, J.W., WAGNER, E.G., WRIGHT, J.B., Initial Algebra Semantics and Coninuous Algebras, JACM,Vol. 24, 1 (1977), pp. 68–95.

    Article  Google Scholar 

  11. INDERMARK, K., Schemes with recursion on higher types, Proc. 5th conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 45 (1976), Springer Verlag, pp. 352–358.

    Google Scholar 

  12. MASLOV, A.N., The Hierarchy of Indexed Languages of an Arbitrary Level, Soviet. Math. Dokl., Vol. 15, 14 (1974), pp. 1170–1174.

    Google Scholar 

  13. NIVAT, M., On the interpretation of recursive program schemes, Atti del convegno di informatica teorica, Symposia Mathematica, Vol. 15 (1975), Rome, pp. 256–281.

    Google Scholar 

  14. SCHMIDT, E.M., Succintness of Description of Context-free, Regular, and Finite Languages, Datalogisk Afdelning Report, DAIMI PB-84, Aarhus University (1978).

    Google Scholar 

  15. STEYAERT, J.M., Evaluation des Index Rationnels de quelques Familles de Langages, IRIA-report No. 261 (1977).

    Google Scholar 

  16. WAND, M., A Concrete Approach to Abstract Recursive Definitions, Automata, Languages, and Programming, ed. M. Nivat, North-Holland Publishing Company (1973), pp. 331–341.

    Google Scholar 

  17. WAND, M., An Algebraic Formulation of the Chomsky-Hierarchy, Category Theory Applied to Computation and Control, Lecture Notes in Computer Science 25 (1975), pp. 209–213.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik II, RWTH Aachen, Germany

    W. Damm

Authors
  1. W. Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damm, W. (1979). An algebraic extension of the Chomsky — hierarchy. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation