×

zbMATH — the first resource for mathematics

Parys, Paweł

Compute Distance To:
Author ID: parys.pawel Recent zbMATH articles by "Parys, Paweł"
Published as: Parys, Pawel; Parys, Paweł
Documents Indexed: 32 Publications since 2008

Publications by Year

Citations contained in zbMATH

15 Publications have been cited 31 times in 22 Documents Cited by Year
On the significance of the collapse operation. Zbl 1360.68569
Parys, Paweł
4
2012
Strictness of the collapsible pushdown hierarchy. Zbl 1365.68307
Kartzow, Alexander; Parys, Paweł
4
2012
The diagonal problem for higher-order recursion schemes is decidable. Zbl 1401.68158
Clemente, Lorenzo; Parys, Paweł; Salvati, Sylvain; Walukiewicz, Igor
3
2016
The MSO+U theory of \((\mathbb N,<)\) is undecidable. Zbl 1388.03016
Bojanczyk, Mikolaj; Parys, Pawel; Torunczyk, Szymon
3
2016
XPath evaluation in linear time. Zbl 1281.68093
Bojańczyk, Mikołaj; Parys, Paweł
3
2011
Ordered tree-pushdown systems. Zbl 1366.68141
Clemente, Lorenzo; Parys, Paweł; Salvati, Sylvain; Walukiewicz, Igor
2
2015
Two-way cost automata and cost logics over infinite trees. Zbl 1401.68147
Blumensath, Achim; Colcombet, Thomas; Kuperberg, Denis; Parys, Paweł; Vanden Boom, Michael
2
2014
A pumping lemma for pushdown graphs of any level. Zbl 1279.68169
Parys, Paweł
2
2012
Collapse operation increases expressive power of deterministic higher order pushdown automata. Zbl 1253.68206
Parys, Paweł
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
Recursion schemes and the WMSO+U logic. Zbl 07228444
Parys, Paweł
1
2018
Minimization of tree patterns. Zbl 1426.68076
Czerwiński, Wojciech; Martens, Wim; Niewerth, Matthias; Parys, Paweł
1
2018
A characterization of lambda-terms transforming numerals. Zbl 1420.68042
Parys, Paweł
1
2016
How many numbers can a lambda-term contain? Zbl 1416.68043
Parys, Paweł
1
2014
Weak alternating timed automata. Zbl 1248.03058
Parys, Pawel; Walukiewicz, Igor
1
2009
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
Recursion schemes and the WMSO+U logic. Zbl 07228444
Parys, Paweł
1
2018
Minimization of tree patterns. Zbl 1426.68076
Czerwiński, Wojciech; Martens, Wim; Niewerth, Matthias; Parys, Paweł
1
2018
The diagonal problem for higher-order recursion schemes is decidable. Zbl 1401.68158
Clemente, Lorenzo; Parys, Paweł; Salvati, Sylvain; Walukiewicz, Igor
3
2016
The MSO+U theory of \((\mathbb N,<)\) is undecidable. Zbl 1388.03016
Bojanczyk, Mikolaj; Parys, Pawel; Torunczyk, Szymon
3
2016
A characterization of lambda-terms transforming numerals. Zbl 1420.68042
Parys, Paweł
1
2016
Ordered tree-pushdown systems. Zbl 1366.68141
Clemente, Lorenzo; Parys, Paweł; Salvati, Sylvain; Walukiewicz, Igor
2
2015
Two-way cost automata and cost logics over infinite trees. Zbl 1401.68147
Blumensath, Achim; Colcombet, Thomas; Kuperberg, Denis; Parys, Paweł; Vanden Boom, Michael
2
2014
How many numbers can a lambda-term contain? Zbl 1416.68043
Parys, Paweł
1
2014
On the significance of the collapse operation. Zbl 1360.68569
Parys, Paweł
4
2012
Strictness of the collapsible pushdown hierarchy. Zbl 1365.68307
Kartzow, Alexander; Parys, Paweł
4
2012
A pumping lemma for pushdown graphs of any level. Zbl 1279.68169
Parys, Paweł
2
2012
XPath evaluation in linear time. Zbl 1281.68093
Bojańczyk, Mikołaj; Parys, Paweł
3
2011
Collapse operation increases expressive power of deterministic higher order pushdown automata. Zbl 1253.68206
Parys, Paweł
2
2011
Weak alternating timed automata. Zbl 1248.03058
Parys, Pawel; Walukiewicz, Igor
1
2009

Citations by Year