Preview
Unable to display preview. Download preview PDF.
References
ADJ-group: Some fundamentals of order algebraic semantics. MFCS '76, Lect. Notes in Comp. Sci. 45, 1976
Arnold,A., Nivat,M.: Formal computations of non deterministic recursive program schemes. Math. Syst. Th. 13, 1980
Back,J.: The semantics of unbounded non-determinism. ICALP '80, Lect. Notes in Comp. Sci. 85, 1980
Huwig,H.,Poigné,A.: Continuous and non-deterministic completions of algebras. 3rd Hungarian Comp. Sci. Conf., 1981
MacLane,S.: Kategorien. Berlin-Heidelberg-New-York 1972
Manes, E.G.: Algebraic theories. Berlin-Heidelberg-New-York 1976
Nivat,M.: Infinite words. Found. of Comp. Sci.III, ed: deBakker,J., van Leuwen,J., Amsterdam 1979
Nivat,M.: Mots infinie engendré par une grammaire algébrique. R.A.I.R.O. informatique theorique Vol. 11, 1977
Hennessy,M.C.B.,Plotkin,G.: Full abstraction of a simple programming language. MFCS '79, Lect. Notes in Comp. Sci. 74. 1979
Poigné,A.: Using least fixed points to characterize formal computations of non-deterministic equations. Proc. Formal. of Progr. Concepts, Peniscola, Lect. Notes in Comp. Sci. 105, 1981
Poigné,A.: A least fixpoint semantics of non-deterministic schemes. forthcoming
Schützenberger,M.P.: Push-down automata and context-free languages. Inf. and Contr. Vol 6, 1963
Courcelle,B.: Frontiers of infinite trees. RAIRO Inf.Theor. 12, 1978
Heilbrunner,S.: An algorithm for the solution of fixed-point equations for infinite words. RAIRO Inf. Theor. Vol 14, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poigné, A. (1981). Context-free languages of infinite words as least fixpoints. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive