4. RP 2010:
Brno, Czech Republic
: Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P.
: Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata.
: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.
: Efficient Graph Reachability Query Answering Using Tree Decomposition.