Recommendations
Cites work
Cited in
(29)- scientific article; zbMATH DE number 2040320 (Why is no real title available?)
- Definable transductions and weighted logics for texts
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- PURE AND O-SUBSTITUTION
- Minimizing Deterministic Weighted Tree Automata
- On the syntactic complexity of tree series
- Survey: Weighted extended top-down tree transducers. III. Composition
- Actions, finite state sets and applications to trees
- Kleene theorem in partial Conway theories with applications
- Recognizable formal series on trees and cofree coalgebraic systems
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- scientific article; zbMATH DE number 4121414 (Why is no real title available?)
- Formal series over sorted algebras
- Varieties of recognizable tree series over fields
- Lower bounds for arithmetic circuits via the Hankel matrix
- Tree-Series-to-Tree-Series Transformations
- Minimizing deterministic weighted tree automata
- Effective construction of the syntactic algebra of a recognizable series on trees
- Ambiguity Hierarchies for Weighted Tree Automata
- Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series)
- Varieties of formal series on trees and Eilenberg's theorem
- Approximate minimization of weighted tree automata
- Représentations matricielles des séries d'arbre reconnaissables
- scientific article; zbMATH DE number 708666 (Why is no real title available?)
- -Treeautomata and their relation to weighted context-free grammars
- Ranking and formal power series
- Ambiguity hierarchies for weighted tree automata
- Finitely presentable tree series
- Rational transformations and a Kleene theorem for power series over rational monoids
This page was built for publication: The rank of a formal tree power series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792763)
