scientific article; zbMATH DE number 2211801
From MaRDI portal
Publication:5694616
Recommendations
Cited in
(24)- Minimizing deterministic weighted tree automata
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Disambiguation of weighted tree automata
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Approximated determinisation of weighted tree automata
- Sequentiality of group-weighted tree automata
- Efficient enumeration of weighted tree languages over the tropical semiring
- Weighted logics for unranked tree automata
- Cut sets as recognizable tree languages
- An efficient best-trees algorithm for weighted tree automata over the tropical semiring
- scientific article; zbMATH DE number 5854945 (Why is no real title available?)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Minimizing Deterministic Weighted Tree Automata
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Weighted tree generating regular systems over strong bimonoids with reduction semantics
- Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- MAT learners for tree series: an abstract data type and two realizations
- A note on cut-worthiness of recognizable tree series
- Definable transductions and weighted logics for texts
- Weighted tree automata and weighted logics
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 Q5694616)
