scientific article; zbMATH DE number 4135419
From MaRDI portal
Recommendations
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- The congruence theory of closure properties of regular tree languages
- Congruences, homomorphisms and languages of tree automata
- Minimal equational representations of recognizable tree languages
- scientific article; zbMATH DE number 1995181
Cited in
(11)- Restricted ground tree transducers
- Congruential complements of ground term rewrite systems
- Intersection of finitely generated congruences over term algebra
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- Term rewriting restricted to ground terms.
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- scientific article; zbMATH DE number 1995181 (Why is no real title available?)
- Minimal equational representations of recognizable tree languages
- Congruences, homomorphisms and languages of tree automata
- Congruence-based proofs of the recognizability theorems for free many-sorted algebras
- Derivation trees of ground term rewriting systems.
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 Q3468622)
