Weighted finite automata over strong bimonoids

DOI10.1016/j.ins.2009.09.003zbMath1183.68337MaRDI 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

zbMATH Keywords

formal power series; weighted automata; bimonoids; determinizability; multi-valued automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

Related Items

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, Crisp-determinization of weighted tree automata over strong bimonoids, THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES, Unnamed Item, Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata, A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices, Weighted Linear Dynamic Logic, 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, Conditions for the existence of maximal factorizations, Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, McCarthy-Kleene fuzzy automata and MSO logics, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Approximated determinisation of weighted tree automata, Sequentiality of group-weighted tree automata, Weighted automata with storage, The relationships among several forms of weighted finite automata over strong bimonoids, The complexity of computing the behaviour of lattice automata on infinite trees, Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness, On quotients of formal power series, 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, Unnamed Item

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