Restricted ground tree transducers
From MaRDI portal
Recommendations
- Deterministic bottom-up tree transducers and ground term rewrite systems
- On ground tree transformations and congruences induced by tree automata.
- A complete classification of deterministic root-to-frontier tree transformation classes
- Term rewriting restricted to ground terms.
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 4135419 (Why is no real title available?)
- scientific article; zbMATH DE number 1192316 (Why is no real title available?)
- scientific article; zbMATH DE number 58292 (Why is no real title available?)
- scientific article; zbMATH DE number 1337744 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- A Note on the Congruence Lattice of a Finitely Generated Algebra
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- Congruential complements of ground term rewrite systems
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Derivation trees of ground term rewriting systems.
- Minimal equational representations of recognizable tree languages
- Proof lengths for equational completion
- Shostak's congruence closure as completion
- The Church-Rosser property for ground term-rewriting systems is decidable
- Tree generating regular systems
Cited in
(4)
This page was built for publication: Restricted ground tree transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589437)
