19 citations · 53 across the 15 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 7 cited
Reachability Problem for Weak Multi-Pushdown Automata
Wojciech Czerwiński, Piotr Hofman, SŁawomir Lasota
This paper is about reachability analysis in a restricted subclass of multi-pushdown automata. We assume that the control states of an automaton are partially ordered, and all tran…
cs.FL2013
Efficient Separability of Regular Languages by Subsequences and Suffixes
Wojciech Czerwiński, Wim Martens, Tomáš Masopust
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and…