Indermark, K. Complexity of infinite trees. (English) Zbl 0528.68014 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 347-360 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 68Q65 Abstract data types; algebraic specification 68N01 General topics in the theory of software 03D65 Higher-type and set recursion theory 03B40 Combinatory logic and lambda calculus Keywords:higher type recursion; rational schemes; infinite trees; algebraic theory of programming Citations:Zbl 0511.00030; Zbl 0478.68012 PDF BibTeX XML