×

zbMATH — the first resource for mathematics

Czerwiński, Wojciech

Compute Distance To:
Author ID: czerwinski.wojciech Recent zbMATH articles by "Czerwiński, Wojciech"
Published as: Czerwiński, Wojciech
Documents Indexed: 27 Publications since 2009

Publications by Year

Citations contained in zbMATH

17 Publications have been cited 43 times in 38 Documents Cited by Year
Deciding definability by deterministic regular expressions. Zbl 1260.68199
Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim
9
2013
Efficient separability of regular languages by subsequences and suffixes. Zbl 1334.68115
Czerwiński, Wojciech; Martens, Wim; Masopust, Tomáš
8
2013
A note on decidable separability by piecewise testable languages. Zbl 1434.68242
Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc
4
2015
Fast equivalence-checking for normed context-free processes. Zbl 1245.68134
Czerwiński, Wojciech; Lasota, Sławomir
4
2010
The reachability problem for Petri nets is not elementary. Zbl 1433.68245
Czerwiński, Wojciech; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Mazowiecki, Filip
3
2019
Shortest paths in one-counter systems. Zbl 06591836
Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael
2
2016
Reachability problem for weak multi-pushdown automata. Zbl 1364.68247
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2012
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2011
Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games. Zbl 1432.68223
Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł
1
2019
Minimization of tree patterns. Zbl 1426.68076
Czerwiński, Wojciech; Martens, Wim; Niewerth, Matthias; Parys, Paweł
1
2018
A characterization for decidable separability by piecewise testable languages. Zbl 1400.68101
Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc; Zetzsche, Georg
1
2017
Separability of reachability sets of vector addition systems. Zbl 1402.68132
Clemente, Lorenzo; Czerwiński, Wojciech; Lasota, Sławomir; Paperman, Charles
1
2017
Deciding definability by deterministic regular expressions. Zbl 1371.68146
Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim
1
2017
Branching bisimilarity of normed BPA processes is in NExpTime. Zbl 1392.68292
Czerwiński, Wojciech; Jančar, Petr
1
2015
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2014
Reachability problem for weak multi-pushdown automata. Zbl 1274.68156
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2013
Partially-commutative context-free processes. Zbl 1254.68164
Czerwiński, Wojciech; Fröschle, Sibylle; Lasota, Sławomir
1
2009
The reachability problem for Petri nets is not elementary. Zbl 1433.68245
Czerwiński, Wojciech; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Mazowiecki, Filip
3
2019
Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games. Zbl 1432.68223
Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł
1
2019
Minimization of tree patterns. Zbl 1426.68076
Czerwiński, Wojciech; Martens, Wim; Niewerth, Matthias; Parys, Paweł
1
2018
A characterization for decidable separability by piecewise testable languages. Zbl 1400.68101
Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc; Zetzsche, Georg
1
2017
Separability of reachability sets of vector addition systems. Zbl 1402.68132
Clemente, Lorenzo; Czerwiński, Wojciech; Lasota, Sławomir; Paperman, Charles
1
2017
Deciding definability by deterministic regular expressions. Zbl 1371.68146
Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim
1
2017
Shortest paths in one-counter systems. Zbl 06591836
Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael
2
2016
A note on decidable separability by piecewise testable languages. Zbl 1434.68242
Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc
4
2015
Branching bisimilarity of normed BPA processes is in NExpTime. Zbl 1392.68292
Czerwiński, Wojciech; Jančar, Petr
1
2015
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2014
Deciding definability by deterministic regular expressions. Zbl 1260.68199
Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim
9
2013
Efficient separability of regular languages by subsequences and suffixes. Zbl 1334.68115
Czerwiński, Wojciech; Martens, Wim; Masopust, Tomáš
8
2013
Reachability problem for weak multi-pushdown automata. Zbl 1274.68156
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2013
Reachability problem for weak multi-pushdown automata. Zbl 1364.68247
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2012
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2011
Fast equivalence-checking for normed context-free processes. Zbl 1245.68134
Czerwiński, Wojciech; Lasota, Sławomir
4
2010
Partially-commutative context-free processes. Zbl 1254.68164
Czerwiński, Wojciech; Fröschle, Sibylle; Lasota, Sławomir
1
2009

Citations by Year