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