Congruential complements of ground term rewrite systems
From MaRDI portal
Publication:1575250
DOI10.1016/S0304-3975(98)00174-1zbMath0944.68077MaRDI QIDQ1575250
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (7)
Intersection of finitely generated congruences over term algebra ⋮ Term rewriting restricted to ground terms. ⋮ On ground tree transformations and congruences induced by tree automata. ⋮ Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems ⋮ Deterministic bottom-up tree transducers and ground term rewrite systems ⋮ CHAP and rewrite components ⋮ Restricted ground tree transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the modularity of normal forms in rewriting
- Complete axiomatizations of some quotient term algebras
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Reductions in tree replacement systems
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- Decidability of reachability for disjoint union of term rewriting systems
- Derivation trees of ground term rewriting systems.
- Minimal equational representations of recognizable tree languages
- Proof lengths for equational completion
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Termination for direct sums of left-linear complete term rewriting systems
- Tree generating regular systems
This page was built for publication: Congruential complements of ground term rewrite systems
