Pages that link to "Item:Q845343"
From MaRDI portal
The following pages link to Weighted finite automata over strong bimonoids (Q845343):
Displayed 34 items.
- Bisimulations for fuzzy automata (Q423147) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Nondeterministic fuzzy automata (Q712503) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
- Local finiteness in t-norm bimonoids: overlap cases (Q1697352) (← links)
- Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
- Weighted automata and weighted MSO logics for average and long-time behaviors (Q1932173) (← links)
- Conditions for the existence of maximal factorizations (Q2035282) (← 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)
- Approximated determinisation of weighted tree automata (Q2232287) (← links)
- Sequentiality of group-weighted tree automata (Q2232288) (← links)
- Weighted automata with storage (Q2280328) (← links)
- The relationships among several forms of weighted finite automata over strong bimonoids (Q2293180) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness (Q2658032) (← links)
- On quotients of formal power series (Q2672254) (← links)
- Weighted Symbolic Automata with Data Storage (Q2817389) (← links)
- WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS (Q2929640) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- Valuations of Weighted Automata: Doing It in a Rational Way (Q3098044) (← links)
- (Q3384166) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES (Q5247168) (← 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)
- Weighted Linear Dynamic Logic (Q6154979) (← links)