Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
-A.Arnold, M.Nivat, Non-deterministic recursive program schemes, FCT 77, LNCS 56, Springer Verlag (1977), 12â21.
-A.Arnold, M.Nivat, Metric interpretation of infinite trees and semantics of non deterministic recursive programs, Rapport no. IT-3-78,Universite de Lille.
-M.Nivat, Infinite words, infinite trees, infinite computation, Mathematical Centre Tracts 109 (1979), 1â52.
-D.Park, On the semantics of fair parallelism, Abstract Software Specifications, LNCS 86, Springer Verlag(1980), 504â526.
-J.Tiuryn, Fixed points in the power set algebra of infinite trees, Schriften zur Informatik und angewandten Mathematik, RWTH Aachen, (1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
NiwiĆski, D. (1982). Fixed-point semantics for algebraic (tree) grammars. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012785
Download citation
DOI: https://doi.org/10.1007/BFb0012785
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive