scientific article; zbMATH DE number 3439971
From MaRDI portal
zbMath0279.68010MaRDI QIDQ4766003
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)
Related Items
Algebraic solutions to recursion schemes, Continuous monoids and yields of infinite trees, Unnamed Item, Unnamed Item, Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable, Unique fixed points vs. least fixed points, Varieties of chain-complete algebras, The IO- and OI-hierarchies, On rational definitions in complete algebras without rank, An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus, A direct algorithm for checking equivalence of LL(k) grammars, Una classe di schemi ricorsivi non-deterministici paralleli, IO and OI. I, IO and OI. II, Approximation properties of abstract data types, Basic analytic combinatorics of directed lattice paths