Search

• < Previous
• 1
• Next >

---

Reachability Problem for Weak Multi-Pushdown Automata

Wojciech Czerwiński ; Piotr Hofman ; SŁawomir Lasota.

This paper is about reachability analysis in a restricted subclass of multi-pushdown automata. We assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the order. We prove decidability of the reachability problem, and&nbsp;[&hellip;]

---

Shortest paths in one-counter systems

Dmitry Chistikov ; Wojciech Czerwiński ; Piotr Hofman ; Michał Pilipczuk ; Michael Wehar.

We show that any one-counter automaton with $n$ states, if its language is non-empty, accepts some word of length at most $O(n^2)$. This closes the gap between the previously known upper bound of $O(n^3)$ and lower bound of $\Omega(n^2)$. More generally, we prove a tight upper bound on the length of&nbsp;[&hellip;]

---

Regular Separability of One Counter Automata

Wojciech Czerwiński ; Sławomir Lasota.

The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is decidability, and PSpace-completeness, of the regular separability problem for languages of one counter automata without zero tests&nbsp;[&hellip;]

---