scientific article; zbMATH DE number 3439971

MaRDI QIDQ4766003zbMATH OpenFDO

Authors M. Nivat

Publication date 1973

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(16)

• Algebraic solutions to recursion schemes
• 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 K-calculus; and an application of a labelled -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
• Basic analytic combinatorics of directed lattice paths
• Approximation properties of abstract data types
• Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
• scientific article; zbMATH DE number 3870582 (Why is no real title available?)
• Continuous monoids and yields of infinite trees
• scientific article; zbMATH DE number 3607504 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766003)