Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
From MaRDI portal
Publication:2136289
DOI10.1016/j.tcs.2022.03.036OpenAlexW3174116928MaRDI QIDQ2136289
Zoltán Fülöp, Heiko Vogler, Dávid Kószó, Manfred Droste
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.15867
decidabilitysemiringstrong bimonoidweighted tree automatonfinite-image propertypast-finite strong bimonoid
Related Items
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ Unnamed Item ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-weighted automata and MSO logic
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Handbook of weighted automata
- Weighted finite automata over strong bimonoids
- Weighted tree automata and weighted logics
- Determinization of weighted finite automata over strong bimonoids
- Rational languages and the Burnside problem
- Weighted grammars and Kleene's theorem
- Recognizable formal power series on trees
- On finite semigroups of matrices
- On the finite degree of ambiguity of finite tree automata
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Fuzzy tree automata
- Cut sets as recognizable tree languages
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- On the definition of a family of automata
- Graph expressions and graph rewritings
- Some remarks on recognizable treeseries
- Crisp-determinization of weighted tree automata over strong bimonoids
- Semirings and Formal Power Series
- Weighted Tree Automata and Tree Transducers
- Fuzzy Languages
- Automata, Languages and Programming
