Pages that link to "Item:Q991892"

The following pages link to Determinization of weighted finite automata over strong bimonoids (Q991892):

Displaying 31 items.

• Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure (Q279371) (← links)
• Brzozowski type determinization for fuzzy automata (Q279377) (← links)
• Bisimulations for fuzzy automata (Q423147) (← links)
• Determinization of fuzzy automata via factorization of fuzzy states (Q508600) (← links)
• An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
• Logical characterizations of simulation and bisimulation for fuzzy transition systems (Q679804) (← links)
• Further improvements of determinization methods for fuzzy finite automata (Q679810) (← links)
• Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
• Nondeterministic fuzzy automata (Q712503) (← links)
• Model checking computation tree logic over finite lattices (Q896917) (← links)
• Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
• Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
• Conditions for the existence of maximal factorizations (Q2035282) (← links)
• Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
• McCarthy-Kleene fuzzy automata and MSO logics (Q2182728) (← links)
• Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders (Q2200645) (← links)
• Model checking of linear-time properties in multi-valued systems (Q2282319) (← links)
• The relationships among several forms of weighted finite automata over strong bimonoids (Q2293180) (← links)
• WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS (Q2929640) (← links)
• (Q3384166) (← links)
• Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
• THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES (Q5247168) (← links)
• Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application (Q5863634) (← links)
• (Q5871579) (← links)
• Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata (Q6072403) (← links)
• A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
• Bideterministic weighted automata (Q6186321) (← links)
• Weighted Automata over Vector Spaces (Q6204126) (← links)
• Weighted automata and logics meet computational complexity (Q6647756) (← links)