Pages that link to "Item:Q764336"
From MaRDI portal
The following pages link to Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336):
Displayed 31 items.
- Multi-weighted automata and MSO logic (Q504993) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- Model checking fuzzy computation tree logic (Q529056) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- Weighted automata and weighted MSO logics for average and long-time behaviors (Q1932173) (← links)
- Linear weighted tree automata with storage and inverse linear tree homomorphisms (Q2051842) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Weighted automata (Q2074206) (← 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)
- 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)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- A Nivat theorem for weighted picture automata and weighted MSO logics (Q2424674) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Parameterized model checking of weighted networks (Q2447757) (← links)
- On weighted first-order logics with discounting (Q2453983) (← links)
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (Q2799219) (← links)
- Weighted LTL with Discounting (Q2914725) (← links)
- WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS (Q2929640) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- (Q5015275) (← links)
- (Q5092440) (← links)
- THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES (Q5247168) (← links)
- On High-Quality Synthesis (Q5740173) (← links)
- (Q5871579) (← links)
- Modelling Uncertainty in Architectures of Parametric Component-Based Systems (Q6072401) (← links)
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata (Q6072403) (← links)