Pages that link to "Item:Q1389678"

The following pages link to Fixed point characterization of infinite behavior of finite-state systems (Q1389678):

Displaying 19 items.

• The complexity of stochastic Müller games (Q418128) (← links)
• A fixpoint approach to finite delay and fairness (Q1129259) (← links)
• On temporal logic versus Datalog (Q1401358) (← links)
• Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
• On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
• Pushdown processes: Games and model-checking (Q1854405) (← links)
• Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249) (← links)
• Automata and fixed point logic: a coalgebraic perspective (Q2495648) (← links)
• The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
• Modular Games for Coalgebraic Fixed Point Logics (Q2873663) (← links)
• ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH (Q2909221) (← links)
• Domain mu-calculus (Q4460689) (← links)
• Fixpoints, games and the difference hierarchy (Q4462675) (← links)
• Deciding low levels of tree-automata hierarchy (Q4916202) (← links)
• The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
• Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547) (← links)
• On Distributive Fixed-Point Expressions (Q4943552) (← links)
• (Q5015272) (← links)
• Free \(\mu\)-lattices (Q5960406) (← links)