scientific article; zbMATH DE number 1142319

Cited in

(25)

Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
The conflict-free reduction geometry
Linearization in parallel pCRL
Mechanically proving termination using polynomial interpretations
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
Correctness of fixpoint transformations
Equivalence of pushdown automata via first-order grammars
Cones and foci: A mechanical framework for protocol verification
Unfoldings and Coverings of Weighted Graphs
Derivational complexity and context-sensitive Rewriting
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity
Computable concurrent processes
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
Termination of term rewriting using dependency pairs
Program schemes, arrays, Lindström quantifiers and zero-one laws
Totally correct logic program transformations via well-founded annotations
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
Optimal normalization in orthogonal term rewriting systems
The evaluation of first-order substitution is monadic second-order compatible
Theory of computation over stream algebras, and its applications
Picture deformation
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
Equivalence of recursive specifications in process algebra
Basic notions of universal algebra for language theory and graph grammars
Modular and incremental automated termination proofs

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 Q4385535)