×

zbMATH — the first resource for mathematics

Mazowiecki, Filip

Compute Distance To:
Author ID: mazowiecki.filip Recent zbMATH articles by "Mazowiecki, Filip"
Published as: Mazowiecki, Filip
Documents Indexed: 13 Publications since 2013

Publications by Year

Citations contained in zbMATH

9 Publications have been cited 22 times in 17 Documents Cited by Year
Copyless cost-register automata: structure, expressiveness, and closure properties. Zbl 1388.68175
Mazowiecki, Filip; Riveros, Cristian
4
2016
Decidability of weak logics with deterministic transitive closure. Zbl 1394.03015
Charatonik, Witold; Kieroński, Emanuel; Mazowiecki, Filip
4
2014
Complexity of two-variable logic on finite trees. Zbl 1335.68132
Benaim, Saguy; Benedikt, Michael; Charatonik, Witold; Kieroński, Emanuel; Lenhardt, Rastislav; Mazowiecki, Filip; Worrell, James
4
2013
Maximal partition logic: towards a logical characterization of copyless cost register automata. Zbl 1434.03103
Mazowiecki, Filip; Riveros, Cristian
3
2015
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
2
2019
Complexity of two-variable logic on finite trees. Zbl 1367.03062
Benaim, Saguy; Benedikt, Michael; Charatonik, Witold; Kieroński, Emanuel; Lenhardt, Rastislav; Mazowiecki, Filip; Worrell, James
2
2016
Weak cost register automata are still powerful. Zbl 06983369
Almagor, Shaull; Cadilhac, Michaël; Mazowiecki, Filip; Pérez, Guillermo A.
1
2018
Polynomial-space completeness of reachability for succinct branching VASS in dimension one. Zbl 1442.68136
Figueira, Diego; Lazi\c, Ranko; Leroux, Jérôme; Mazowiecki, Filip; Sutre, Grégoire
1
2017
Monadic datalog and regular tree pattern queries. Zbl 1425.68097
Mazowiecki, Filip; Murlak, Filip; Witkowski, Adam
1
2014
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
2
2019
Weak cost register automata are still powerful. Zbl 06983369
Almagor, Shaull; Cadilhac, Michaël; Mazowiecki, Filip; Pérez, Guillermo A.
1
2018
Polynomial-space completeness of reachability for succinct branching VASS in dimension one. Zbl 1442.68136
Figueira, Diego; Lazi\c, Ranko; Leroux, Jérôme; Mazowiecki, Filip; Sutre, Grégoire
1
2017
Copyless cost-register automata: structure, expressiveness, and closure properties. Zbl 1388.68175
Mazowiecki, Filip; Riveros, Cristian
4
2016
Complexity of two-variable logic on finite trees. Zbl 1367.03062
Benaim, Saguy; Benedikt, Michael; Charatonik, Witold; Kieroński, Emanuel; Lenhardt, Rastislav; Mazowiecki, Filip; Worrell, James
2
2016
Maximal partition logic: towards a logical characterization of copyless cost register automata. Zbl 1434.03103
Mazowiecki, Filip; Riveros, Cristian
3
2015
Decidability of weak logics with deterministic transitive closure. Zbl 1394.03015
Charatonik, Witold; Kieroński, Emanuel; Mazowiecki, Filip
4
2014
Monadic datalog and regular tree pattern queries. Zbl 1425.68097
Mazowiecki, Filip; Murlak, Filip; Witkowski, Adam
1
2014
Complexity of two-variable logic on finite trees. Zbl 1335.68132
Benaim, Saguy; Benedikt, Michael; Charatonik, Witold; Kieroński, Emanuel; Lenhardt, Rastislav; Mazowiecki, Filip; Worrell, James
4
2013

Citations by Year