Determinization of weighted finite automata over strong bimonoids

DOI10.1016/j.ins.2010.05.020zbMath1205.68198OpenAlexW2109993263MaRDI QIDQ991892

Jelena Ignjatović, Manfred Droste, Heiko Vogler, Miroslav Ćirić

Publication date: 8 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.05.020

zbMATH Keywords

formal power seriesdeterminizationNerode automatonstrong bimonoidweighted automatonMyhill automatonrun automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items

Crisp-determinization of weighted tree automata over strong bimonoids, Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure, Brzozowski type determinization for fuzzy automata, Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS, McCarthy-Kleene fuzzy automata and MSO logics, Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Bideterministic weighted 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, Bideterministic weighted automata, Bisimulations for fuzzy automata, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Weighted Automata over Vector Spaces, Unnamed Item, Determinization of fuzzy automata via factorization of fuzzy states, Logical characterizations of simulation and bisimulation for fuzzy transition systems, Further improvements of determinization methods for fuzzy finite 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, Model checking of linear-time properties in multi-valued systems, Conditions for the existence of maximal factorizations, The relationships among several forms of weighted finite automata over strong bimonoids, Determinisability of unary weighted automata over the rational numbers, THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application

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
• Automata theory based on quantum logic: Some characterizations
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• On the recognizability of fuzzy languages. II
• Handbook of weighted automata
• Weighted finite automata over strong bimonoids
• On the recognizability of fuzzy languages. I
• Myhill-Nerode type theory for fuzzy languages and automata
• Finite tree automata with cost functions
• Triangular norms
• Minimization algorithms for sequential transducers
• Automata theory based on quantum logic. I
• Formal power series and regular operations on fuzzy languages
• Fuzzy tree language recognizability
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Determinization of fuzzy automata with membership values in complete residuated lattices
• A theory of computation based on quantum logic. I
• Expressiveness and Closure Properties for Quantitative Languages
• Alternating Weighted Automata
• Quantitative Languages
• Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
• Initial Algebra Semantics and Continuous Algebras
• Finite automata based on quantum logic and monadic second-order quantum logic
• Automata theory based on quantum logic. II.
• Multiset processing. Mathematical, computer science, and molecular computing points of view