Determinization of weighted finite automata over strong bimonoids
From MaRDI portal
Publication:991892
DOI10.1016/J.INS.2010.05.020zbMATH Open1205.68198OpenAlexW2109993263MaRDI QIDQ991892FDOQ991892
Authors: Miroslav Ćirić, Manfred Droste, Jelena Ignjatović, Heiko Vogler 
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
Recommendations
- Weighted finite automata over strong bimonoids
- An improved algorithm for determinization of weighted and fuzzy automata
- Crisp-determinization of weighted tree automata over strong bimonoids
- The relationships among several forms of weighted finite automata over strong bimonoids
- scientific article; zbMATH DE number 6124028
formal power seriesdeterminizationNerode automatonstrong bimonoidweighted automatonMyhill automatonrun automaton
Cites Work
- Triangular norms
- Title not available (Why is that?)
- Initial Algebra Semantics and Continuous Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of weighted automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal power series and regular operations on fuzzy languages
- Fuzzy tree language recognizability
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- On the recognizability of fuzzy languages. II
- On the recognizability of fuzzy languages. I
- Myhill-Nerode type theory for fuzzy languages and automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiset processing. Mathematical, computer science, and molecular computing points of view
- Expressiveness and closure properties for quantitative languages
- Alternating Weighted Automata
- Quantitative Languages
- Minimization algorithms for sequential transducers
- Automata theory based on quantum logic. I
- Automata theory based on quantum logic: reversibilities and pushdown automata
- A theory of computation based on quantum logic. I
- Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
- Finite automata based on quantum logic and monadic second-order quantum logic
- Automata theory based on quantum logic. II.
- Automata theory based on quantum logic: Some characterizations
- Weighted finite automata over strong bimonoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite tree automata with cost functions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (38)
- Title not available (Why is that?)
- Determinations of weighted finite automata over commutative idempotent MF-semirings
- Title not available (Why is that?)
- Bideterministic weighted automata
- Model checking of linear-time properties in multi-valued systems
- MK-fuzzy automata and MSO logics
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- Bisimulations for fuzzy automata
- McCarthy-Kleene fuzzy automata and MSO logics
- Crisp-determinization of weighted tree automata over strong bimonoids
- Brzozowski type determinization for fuzzy automata
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Nondeterministic fuzzy automata
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- An improved algorithm for determinization of weighted and fuzzy automata
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Weighted finite automata over strong bimonoids
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Bideterministic weighted automata
- Conditions for the existence of maximal factorizations
- Weighted nested word automata and logics over strong bimonoids
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
- Construction of fuzzy automata from fuzzy regular expressions
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
- Model checking computation tree logic over finite lattices
- Congruence and minimization of deterministic weighted finite automata
- Determinisability of unary weighted automata over the rational numbers
- Weighted Automata over Vector Spaces
- Weighted automata and logics meet computational complexity
- The relationships among several forms of weighted finite automata over strong bimonoids
- Determinization of fuzzy automata via factorization of fuzzy states
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Title not available (Why is that?)
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Determinization of weighted finite automata over strong bimonoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991892)
