This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
de Bakker I.W. and de Roever W.P., A calculus for recursive program schemes, Proc.IRIA Symp. on Automata Formal Languages and Programming 1972, North-Holland, Amsterdam
Blikle A., Nets; complete lattices with a composition, Bull. Acad.Polon. Sci.,Sér.Sci.Math.Astr.Phys.19,859–863,1971
Blikle A., An extended approach to mathematical analysis of programs, CC PAS Reports 169,1974
Griffith T.V., The unsolvability of the equivalence problem for -free nondeterministic generalized machines, Journal of ACM, vol15, No3,pp.409–413.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grabowski, M. (1976). A remark on equivalence of Mazurkiewicz's finite — control algorithms over nets. 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_192
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_192
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