19 citations · 53 across the 15 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.FL2015★ 5 cited
Shortest paths in one-counter systems
Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman +2
We show that any one-counter automaton with states, if its language is non-empty, accepts some word of length at most . This closes the gap between the previously known…
cs.DM2015
Non-dominating sequences of vectors using only resets and increments
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequenc…