Pages that link to "Item:Q896917"
From MaRDI portal
The following pages link to Model checking computation tree logic over finite lattices (Q896917):
Displayed 8 items.
- Bisimulations for fuzzy transition systems revisited (Q1648774) (← links)
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems (Q1697986) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices (Q2143812) (← links)
- The relationships among several forms of weighted finite automata over strong bimonoids (Q2293180) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- Multi-valued Verification of Strategic Ability (Q4988961) (← links)