Preview
Unable to display preview. Download preview PDF.
References
ADJ (J.A.Goguen, J.W.Thatcher, E.G.Wagner, J.B.Wright), A Junction between Computer Science and Category Theory, IBM Research Report RC 4526 (1973), IBM Research Report RC 5908 (1976).
ADJ, Initial Algebra Semantics and Continuous Algebras, J. Assoc. Comput. Mach. 24 (1977).
ADJ (EGW, JWT, JBW), Free Continuous Theories, IBM Research Raport RC 6906 (1977).
ADJ (JWT, EGW, JBW), Notes on Algebraic Fundamentals for Theoretical Computer Science, Mathematical Centre Tracts 109 (1979).
R.M.Burstall, J.A. Goguen, Some Fundamentals Properties of Algebraic Theories: A Tool for Semantics of Computation, Theoret.Comput.Sci., 31 (1984).
V.E.CĂzĂnescu, Partial Flowcharts, Infinite Flowcharts and Rational Flowcharts, INCREST Preprint Series in Mathematics No.42 (1985).
M.Nivat, On the Interpretation of Polyadic Recursive Program Schemes, Symposia Mathematica, XV, Istituto Nazionale di Alta Matematica, Italy (1975).
M.P.Schützenberger, Pushdown Automata and Context-free Languages, Inform. and Control, 6 (1963).
D.Scott, The Lattice of Flow Diagrams, Lecture Notes in Mathematics 188, Springer-Verlag (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
CĂzĂnescu, V.E. (1986). Iterative systems of equations. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016247
Download citation
DOI: https://doi.org/10.1007/BFb0016247
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive