Pages that link to "Item:Q1887159"

The following pages link to DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159):

Displayed 5 items.

• Verification of qualitative \(\mathbb Z\) constraints (Q959820) ‎ (← links)
• Model checking memoryful linear-time logics over one-counter automata (Q974117) ‎ (← links)
• A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) ‎ (← links)
• Reachability in Succinct and Parametric One-Counter Automata (Q3184686) ‎ (← links)
• Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) ‎ (← links)