- Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems Lorenzo Clemente Sławomir Lasota Ranko Lazić Filip Mazowiecki Wed 12 June 2019
- Karp-Miller Trees for a Branching Extension of VASS Kumar Neeraj Verma Jean Goubault-Larrecq Thu 01 June 2017
- The reachability problem for branching vector addition systems requires doubly-exponential space Ranko Lazić Mon 11 November 2013
- Vector Addition Tree Automata Philippe de Groote Bruno Guillaume Sylvain Salvati Mon 11 November 2013
- On the computational complexity of dominance links in grammatical formalisms Sylvain Schmitz Mon 11 November 2013
- Multiset-valued linear index grammars: imposing dominance constraints on derivations Owen Rambow Mon 11 November 2013
- The covering and boundedness problems for branching vector addition systems Stephane Demri Marcin Jurdziński Oded Lachish Ranko Lazic Tue 18 December 2012
Library Size: 13G (7 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
