Restricted ground tree transducers
From MaRDI portal
Publication:1589437
DOI10.1016/S0304-3975(99)00135-8zbMath0952.68078MaRDI QIDQ1589437
Zoltán Fülöp, Sándor Vágvölgyi
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Intersection of finitely generated congruences over term algebra ⋮ Term rewriting restricted to ground terms. ⋮ On ground tree transformations and congruences induced by tree automata. ⋮ Symbol different term rewrite systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The Church-Rosser property for ground term-rewriting systems is decidable
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- Congruential complements of ground term rewrite systems
- Derivation trees of ground term rewriting systems.
- Minimal equational representations of recognizable tree languages
- Proof lengths for equational completion
- A Note on the Congruence Lattice of a Finitely Generated Algebra
- Shostak's congruence closure as completion
- Tree generating regular systems
This page was built for publication: Restricted ground tree transducers
