Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
Finite tree automata with cost functions
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Minimization algorithms for sequential transducers
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Automata theory based on quantum logic: some characterizations
Information and Computation
A theory of computation based on quantum logic (I)
Theoretical Computer Science
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
On the recognizability of fuzzy languages II
Fuzzy Sets and Systems
Expressiveness and Closure Properties for Quantitative Languages
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Fuzzy tree language recognizability
Fuzzy Sets and Systems
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Nondeterministic fuzzy automata
Information Sciences: an International Journal
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Hi-index | 0.07 |
We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated submonoids. Moreover, for a given weighted finite automaton we construct the Nerode automaton and Myhill automaton, both being crisp-deterministic, which are equivalent to the original automaton with respect to the initial algebra semantics, respectively, the transition semantics. We prove necessary and sufficient conditions under which the Nerode automaton and the Myhill automaton are finite, and we provide efficient algorithms for their construction. Also, for a given weighted finite automaton, we show sufficient conditions under which a given weighted finite automaton can be determinized preserving its run semantics.