The following pages link to Lattice Automata (Q5452607):
Displaying 47 items.
- Bisimulations for fuzzy automata (Q423147) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Nondeterministic fuzzy automata with membership values in complete residuated lattices (Q511624) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← 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)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- Weighted automata (Q2074206) (← links)
- Algebraic presentation of semifree monads (Q2104481) (← links)
- Beyond vacuity: towards the strongest passing formula (Q2248090) (← links)
- Model checking of linear-time properties in multi-valued systems (Q2282319) (← links)
- Simulation for lattice-valued doubly labeled transition systems (Q2353987) (← 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)
- Weighted LTL with Discounting (Q2914725) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Inherent Vacuity in Lattice Automata (Q2947173) (← links)
- Regular Expressions on Average and in the Long Run (Q3073640) (← links)
- Latticed Simulation Relations and Games (Q3510804) (← links)
- On Omega-Languages Defined by Mean-Payoff Conditions (Q3617739) (← links)
- A Weighted μ-Calculus on Words (Q3637241) (← links)
- (Q4493262) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- (Q5015275) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- Model Checking for Action Abstraction (Q5452711) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- Minimizing Deterministic Lattice Automata (Q5892175) (← links)
- Equilibrium in two-player stochastic games with shift-invariant payoffs (Q6057758) (← links)
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information (Q6098854) (← links)
- Weighted Linear Dynamic Logic (Q6154979) (← links)
- Learning and characterizing fully-ordered lattice automata (Q6160917) (← links)
- Lattice-valued general orthomodular automata (Q6163511) (← links)
- Linear-time logics -- a coalgebraic perspective (Q6563060) (← links)
