Weighted finite automata over strong bimonoids
From MaRDI portal
Publication:845343
DOI10.1016/j.ins.2009.09.003zbMath1183.68337MaRDI QIDQ845343
Manfred Droste, Heiko Vogler, Torsten Stüber
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
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES, Bisimulations for fuzzy automata, An improved algorithm for determinization of weighted and fuzzy automata, Computation of the greatest simulations and bisimulations between fuzzy automata, Nondeterministic fuzzy automata, Weighted automata and multi-valued logics over arbitrary bounded lattices, Equational weighted tree transformations, Model checking computation tree logic over finite lattices, Determinization of weighted finite automata over strong bimonoids, Local finiteness in t-norm bimonoids: overlap cases, Construction of fuzzy automata from fuzzy regular expressions, Weighted automata and weighted MSO logics for average and long-time behaviors, The complexity of computing the behaviour of lattice automata on infinite trees, Weighted Symbolic Automata with Data Storage, WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Valuations of Weighted Automata: Doing It in a Rational Way
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
