Skip to main content
SpringerLink
Log in

An algebraic theory of formal languages

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

  • 1897 Accesses

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. Aho, A.V., Indexed Grammars — An Extension of Context-Free Grammars, J.A.C.M., Vol. 15, No. 4, 1967.

    Google Scholar 

  2. Brainerd, W.E., Tree Generating Regular Systems, Inform. & Control, Vol. 14, 1969.

    Google Scholar 

  3. Cohn, P.M., Universal Algebra, Harper and Row, 1964.

    Google Scholar 

  4. Curry, H.B. and Feys, R., Combinatory Logic, Vol. 1, North Holland, 1958.

    Google Scholar 

  5. Eilenberg, S. and Wright, J.B., Automata in General Algebras, Inform. & Control, Vol. 11, 1967.

    Google Scholar 

  6. Ginsburg, S. and Greibach, S.A., Abstract Families of Languages, Proc. 8th I.E.E.E. Symp. on Switching and Automata Theory, 1967.

    Google Scholar 

  7. Gratzer, G., Universal Algebra, Van Nostrand, Reinhold, 1968.

    Google Scholar 

  8. Lawvere, F.W., Functional Semantics of Algebraic Theories, Proc. Nat. Academy of Sciences, Vol. 50.

    Google Scholar 

  9. Mezei, J. and Wright, J.B., Generalised ALGOL-like Languages, I.B.M. Research Paper, RE1528, 1968.

    Google Scholar 

  10. Rounds, W.C., Mappings and Grammars on Trees, Mathematical Systems Theory, Vol. 4, No. 3, 1969.

    Google Scholar 

  11. Scott, D., Continuous Lattices, Monograph PRG-7. Oxford University Computing Laboratory, 1971.

    Google Scholar 

  12. Thatcher, J.W., Characterising Derivation Trees of Context-Free grammars through a Generalisation of Finite Automata Theory, J.C.S.S., Vol. 1, 1967.

    Google Scholar 

  13. Thatcher, J.W. and Wright, J.B., Generalised Finite Automata Theory with an Application to Second Order Logic, Mth. Systems Th., Vol. 2.

    Google Scholar 

  14. Turner, R., Tree Grammars, to appear.

    Google Scholar 

  15. Turner, R., An Infinite Hierarchy of Term Languages, Theorie de Automates de Languages et de la Programmation, 1972.

    Google Scholar 

  16. Turner, R., Ph.D. thesis, London, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Essex, Colchester, England

    Raymond Turner

Authors
  1. Raymond Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Turner, R. (1975). An algebraic theory of formal languages. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_228

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_228

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation