Pages that link to "Item:Q1807671"
From MaRDI portal
The following pages link to A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671):
Displaying 5 items.
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- ON STRONG REVERSIBILITY IN <font>P</font> SYSTEMS AND RELATED PROBLEMS (Q3076593) (← links)
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES (Q4923281) (← links)
- ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS (Q5249293) (← links)
