1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.LO2020
Countdown games, and simulation on (succinct) one-counter nets
Petr Jancar, Petr Osicka, Zdenek Sawa
We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) for simulation preorder on the class of succinct one-counter nets (i.e., one-counter automata with…
cs.LO2018★ 1 cited
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets
Petr Jancar, Petr Osicka, Zdenek Sawa
We note that the remarkable EXPSPACE-hardness result in [Göller, Haase, Ouaknine, Worrell, ICALP 2010] ([GHOW10] for short) allows us to answer an open complexity question for simu…