CONTEXT-FREE LANGUAGES, GROUPS, THE THEORY OF ENDS, SECOND-ORDER LOGIC, TILING PROBLEMS, CELLULAR AUTOMATA, AND VECTOR ADDITION SYSTEMSMULLER DE; SCHUPP PE.1981; BULL. AM. MATH. SOC.; ISSN 0002-9904; USA; DA. 1981; VOL. 4; NO 3; PP. 331-334; BIBL. 4 REF.Article

An On^1.5 algorithm to decide boundedness for conflict-free vector replacement systemsHOWELL, R. R; ROSIER, L. E; HSU-CHU YEN et al.Information processing letters. 1987, Vol 25, Num 1, pp 27-33, issn 0020-0190Article

The reachability problem for branching vector addition systems requires doubly-exponential spaceLAZIC, Ranko.Information processing letters. 2010, Vol 110, Num 17, pp 740-745, issn 0020-0190, 6 p.Article

On the finite containment problem forPetri netsCLOTE, P.Theoretical computer science. 1986, Vol 43, Num 1, pp 99-105, issn 0304-3975Article

Strategy synthesis for multi-dimensional quantitative objectivesCHATTERJEE, Krishnendu; RANDOUR, Mickael; RASKIN, Jean-François et al.Acta informatica. 2014, Vol 51, Num 3-4, pp 129-163, issn 0001-5903, 35 p.Conference Paper

Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with statesHOWELL, R. R; ROSIER, L. E; HUYNH, D. T et al.Theoretical computer science. 1986, Vol 46, Num 2-3, pp 107-140, issn 0304-3975Article

On minimal elements of upward-closed setsYEN, Hsu-Chun; CHEN, Chien-Liang.Theoretical computer science. 2009, Vol 410, Num 24-25, pp 2442-2452, issn 0304-3975, 11 p.Article

Cycles and communicating classes in membrane systems and molecular dynamicsMUSKULUS, Michael; BESOZZI, Daniela; BRIJDER, Robert et al.Theoretical computer science. 2007, Vol 372, Num 2-3, pp 242-266, issn 0304-3975, 25 p.Conference Paper