scientific article; zbMATH DE number 3540387

zbMath0346.68041MaRDI QIDQ4116078

Maurice Nivat

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (56)

On context-free trees ⋮ Algebraic semantics and complexity of term rewriting systems ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Unnamed Item ⋮ The category-theoretic solution of recursive program schemes ⋮ Unnamed Item ⋮ Full abstraction and limiting completeness in equational languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computing in unpredictable environments: semantics, reduction strategies, and program transformations ⋮ The equational logic of fixed points ⋮ Metric interpretations of infinite trees and semantics of non deterministic recursive programs ⋮ Partially additive categories and flow-diagram semantics ⋮ On the complexity of \(\omega\)-type Turing acceptors ⋮ Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable ⋮ Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I ⋮ Varieties of chain-complete algebras ⋮ Decidable subcases of the equivalence problem for recursive program schemes ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ Combining data type and recursive process specifications using projection algebras ⋮ Recursion-closed algebraic theories ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ Algebraic specification of concurrent systems ⋮ Recognizable formal power series on trees ⋮ Graph grammars and operational semantics ⋮ Rewrite, rewrite, rewrite, rewrite, rewrite, \dots ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Pushdown tree automata ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Completeness results for the equivalence of recursive schemas ⋮ IO and OI. I ⋮ IO and OI. II ⋮ On some classes of interpretations ⋮ Formal computations of non deterministic recursive program schemes ⋮ Program transformations and algebraic semantics ⋮ Deterministic finite automata with recursive calls and DPDAs ⋮ A unifying theorem for algebraic semantics and dynamic logics ⋮ Expressive power of typed and type-free programming languages ⋮ Recursion induction principle revisited ⋮ A Mezei-Wright theorem for categorical algebras ⋮ Iterative factor algebras and induced metrics ⋮ All solutions of a system of recursion equations in infinite trees and other contraction theories ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems ⋮ Fundamental properties of infinite trees ⋮ Rational set of trees and the algebraic semantics of logic programming ⋮ Order completion monads ⋮ On the Herbrand-Kleene universe for nondeterministic computations ⋮ Extended macro grammars and stack controlled machines ⋮ A short scientific biography of Maurice Nivat ⋮ Macro tree transducers ⋮ Computing in unpredictable environments: Semantics, reduction strategies, and program transformations

This page was built for publication: