Term rewriting restricted to ground terms.
From MaRDI portal
Publication:1401322
DOI10.1016/S0304-3975(02)00745-4zbMath1046.68066MaRDI QIDQ1401322
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
Symbol different term rewrite systems ⋮ Deterministic bottom-up tree transducers and ground term rewrite systems
Cites Work
- 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
- The Church-Rosser property for ground term-rewriting systems is decidable
- 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
- Some undecidability results concerning the property of preserving regularity
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- Congruential complements of ground term rewrite systems
- A property of left-linear rewrite systems preserving recognizability
- Restricted ground tree transducers
- Derivation trees of ground term rewriting systems.
- Minimal equational representations of recognizable tree languages
- Proof lengths for equational completion
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Shostak's congruence closure as completion
- Tree generating regular systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Term rewriting restricted to ground terms.
