scientific article; zbMATH DE number 1142319
From MaRDI portal
Publication:4385535
zbMath0900.68095MaRDI QIDQ4385535
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Correctness of fixpoint transformations ⋮ Order-theoretic Trees: Monadic Second-order Descriptions and Regularity ⋮ Optimal normalization in orthogonal term rewriting systems ⋮ Mechanically proving termination using polynomial interpretations ⋮ Cones and foci: A mechanical framework for protocol verification ⋮ Computing in unpredictable environments: semantics, reduction strategies, and program transformations ⋮ Theory of computation over stream algebras, and its applications ⋮ Unfoldings and Coverings of Weighted Graphs ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Termination of term rewriting using dependency pairs ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ Computable concurrent processes ⋮ Picture deformation ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ Linearization in parallel pCRL ⋮ Totally correct logic program transformations via well-founded annotations ⋮ Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence ⋮ Derivational complexity and context-sensitive Rewriting ⋮ The conflict-free reduction geometry ⋮ Modular and incremental automated termination proofs ⋮ On the Decidability of the Equivalence Problem for Monadic Recursive Programs ⋮ The evaluation of first-order substitution is monadic second-order compatible ⋮ Program schemes, arrays, Lindström quantifiers and zero-one laws ⋮ Equivalence of recursive specifications in process algebra ⋮ Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
This page was built for publication:
