scientific article; zbMATH DE number 3448081
From MaRDI portal
zbMath0285.68022MaRDI QIDQ4772711
G. Kahn, Bruno Courcelle, Jean E. Vuillemin
Publication date: 1974
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
Axiomatizing the equational theory of regular tree languages, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, On schematological equivalence of partially interpreted dataflow networks, Rational rewriting, The equational logic of fixed points, Varieties of chain-complete algebras, Unnamed Item, Infinite normal forms for non-linear term rewriting systems, Deciding observational congruence of finite-state CCS expressions by rewriting, Term graph rewriting, Unnamed Item, Completeness results for the equivalence of recursive schemas, Initial Algebra Semantics for Cyclic Sharing Structures, Type inference with recursive types: Syntax and semantics, On the logic of unification, The insensitivity theorem for nonreducing reflexive types, Fundamental properties of infinite trees