This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Literature
Bekić,H. Definable operations in general algebras and the theory of automata and flowcharts. IBM, Vienna, (1969).
Hack,M. Petri Net Languages, MIT Comp. Struct. Group Memo 124, (1975).
Höpner,M. Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Inst.für Informatik, Univ.Hamburg, Tech. Rep. Nr 12, (1974).
Höpner,M. Families of Languages Defined by Shuffle Operations, submitted for publication, (1976).
Höpner,M. Opp,M. Renaming and Erasing in Szilard Languages, Univ. Hamburg, Tech.Rep. to be published, (1976)
Mazurkiewicz,A. Parallel Recursive Program Schemes, 4th Symp. MFCS Marianske Lazne, (1975).
Opp,M. Eine Beschreibung kontextfreier Sprachen durch endliche Mengensysteme, 2nd GI Conf. on Aut.Th. and Formal Lang.,Kaiserslautern, (1975).
Opp,M. Charakterisierungen erkennbarer Termmengen in absolut freien universellen Algebren, Diss.Hamburg, (1975).
Wand,M. Mathematical foundations of formal language theory, MIT, MAC TR — 108, (1973).
Author information
Authors and Affiliations
Editor information
Rights 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