Skip to main content

About three equational classes of languages built up by shuffle operations

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Bekić,H. Definable operations in general algebras and the theory of automata and flowcharts. IBM, Vienna, (1969).

    Google Scholar 

  2. Hack,M. Petri Net Languages, MIT Comp. Struct. Group Memo 124, (1975).

    Google Scholar 

  3. Höpner,M. Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Inst.für Informatik, Univ.Hamburg, Tech. Rep. Nr 12, (1974).

    Google Scholar 

  4. Höpner,M. Families of Languages Defined by Shuffle Operations, submitted for publication, (1976).

    Google Scholar 

  5. Höpner,M. Opp,M. Renaming and Erasing in Szilard Languages, Univ. Hamburg, Tech.Rep. to be published, (1976)

    Google Scholar 

  6. Mazurkiewicz,A. Parallel Recursive Program Schemes, 4th Symp. MFCS Marianske Lazne, (1975).

    Google Scholar 

  7. Opp,M. Eine Beschreibung kontextfreier Sprachen durch endliche Mengensysteme, 2nd GI Conf. on Aut.Th. and Formal Lang.,Kaiserslautern, (1975).

    Google Scholar 

  8. Opp,M. Charakterisierungen erkennbarer Termmengen in absolut freien universellen Algebren, Diss.Hamburg, (1975).

    Google Scholar 

  9. Wand,M. Mathematical foundations of formal language theory, MIT, MAC TR — 108, (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Höpner, M., Opp, M. (1976). About three equational classes of languages built up by shuffle operations. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_196

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_196

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics