Weighted finite automata over strong bimonoids
From MaRDI portal
Publication:845343
DOI10.1016/j.ins.2009.09.003zbMath1183.68337OpenAlexW1977218932MaRDI QIDQ845343
Torsten Stüber, Manfred Droste, Heiko Vogler
Publication date: 28 January 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://ul.qucosa.de/id/qucosa%3A32477
Related Items
Crisp-determinization of weighted tree automata over strong bimonoids ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ McCarthy-Kleene fuzzy automata and MSO logics ⋮ On quotients of formal power series ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ Model checking computation tree logic over finite lattices ⋮ Unnamed Item ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Weighted Linear Dynamic Logic ⋮ Local finiteness in t-norm bimonoids: overlap cases ⋮ Bisimulations for fuzzy automata ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Unnamed Item ⋮ The complexity of computing the behaviour of lattice automata on infinite trees ⋮ Approximated determinisation of weighted tree automata ⋮ Sequentiality of group-weighted tree automata ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Nondeterministic fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Weighted automata with storage ⋮ Conditions for the existence of maximal factorizations ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS ⋮ Weighted Symbolic Automata with Data Storage ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Equational weighted tree transformations ⋮ THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- A note on cut-worthiness of recognizable tree series
- Handbook of weighted automata
- A characterization of attributed tree transformations by a subclass of macro tree transducers
- Minimization algorithms for sequential transducers
- The design principles of a weighted finite-state transducer library
- Determinism and fuzzy automata
- Approximation and robustness of fuzzy finite automata
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Weighted automata and weighted logics
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Cut sets as recognizable tree languages
- On the Determinization of Weighted Finite Automata
- On the definition of a family of automata
- Digital Image Compression
- Applications of Weighted Automata in Natural Language Processing
