A Kleene theorem for weighted tree automata over distributive multioperator monoids
From MaRDI portal
Publication:2272217
DOI10.1007/s00224-007-9091-9zbMath1192.68408OpenAlexW2083816738MaRDI QIDQ2272217
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9091-9
Related Items
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, Unnamed Item, Effective optimization with weighted automata on decomposable trees, A Büchi-like theorem for weighted tree automata over multioperator monoids, A Kleene theorem for weighted tree automata over tree valuation monoids, Characterizations of recognizable weighted tree languages by logic and bimorphisms, Kleene and Büchi theorems for weighted forest languages over M-monoids, Weighted parsing for grammar-based language models over multioperator monoids, Principal abstract families of weighted tree languages, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Characterization of tree automata based on quantum logic, A link between multioperator and tree valuation automata and logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Compositions of tree series transformations
- Characterizations of recognizable picture series
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Recognizable formal power series on trees
- Equational elements in additive algebras
- A Kleene theorem for weighted tree automata
- Hierarchies of tree series transformations
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Context-free series on trees
- On the definition of a family of automata
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Fundamentals of Computation Theory