Filip Mazowiecki
Título
Citado por
Citado por
Año
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
322019
Complexity of two-variable logic on finite trees
S Benaim, M Benedikt, W Charatonik, E Kieroński, R Lenhardt, ...
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016
30*2016
Copyless cost-register automata: Structure, expressiveness, and closure properties
F Mazowiecki, C Riveros
Journal of Computer and System Sciences 100, 1-29, 2019
14*2019
Decidability of weak logics with deterministic transitive closure
W Charatonik, E Kieroński, F Mazowiecki
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
112014
Maximal partition logic: Towards a logical characterization of copyless cost register automata
F Mazowiecki, C Riveros
24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015
102015
Timed pushdown automata and branching vector addition systems
L Clemente, S Lasota, R Lazić, F Mazowiecki
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
92017
Polynomial-space completeness of reachability for succinct branching VASS in dimension one
D Figueira, R Lazić, J Leroux, F Mazowiecki, G Sutre
82017
Affine extensions of integer vector addition systems with states
M Blondin, C Haase, F Mazowiecki, M Raskin
arXiv preprint arXiv:1909.12386, 2019
72019
When is containment decidable for probabilistic automata?
L Daviaud, M Jurdziński, R Lazić, F Mazowiecki, GA Pérez, J Worrell
arXiv preprint arXiv:1804.09077, 2018
62018
Weak cost register automata are still powerful
S Almagor, M Cadilhac, F Mazowiecki, GA Pérez
International Conference on Developments in Language Theory, 83-95, 2018
52018
Pumping lemmas for weighted automata
F Mazowiecki, C Riveros
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
42018
Monadic datalog and regular tree pattern queries
F Mazowiecki, F Murlak, A Witkowski
ACM Transactions on Database Systems (TODS) 41 (3), 1-43, 2016
32016
A Robust Class of Linear Recurrence Sequences
C Barloy, N Fijalkow, N Lhote, F Mazowiecki
arXiv preprint arXiv:1908.03890, 2019
22019
Eliminating recursion from monadic datalog programs on trees
F Mazowiecki, J Ochremiak, A Witkowski
International Symposium on Mathematical Foundations of Computer Science, 394-406, 2015
22015
On polynomial recursive sequences
M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues
arXiv preprint arXiv:2002.08630, 2020
2020
The monitoring problem for timed automata
A Grez, F Mazowiecki, M Pilipczuk, G Puppis, C Riveros
arXiv preprint arXiv:2002.07049, 2020
2020
Pumping lemmas for weighted automata
A Chattopadhyay, F Mazowiecki, A Muscholl, C Riveros
arXiv preprint arXiv:2001.06272, 2020
2020
Reachability in fixed dimension vector addition systems with states
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
arXiv preprint arXiv:2001.04327, 2020
2020
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
L Clemente, S Lasota, R Lazić, F Mazowiecki
ACM Transactions on Computational Logic (TOCL) 20 (3), 1-31, 2019
2019
Reachability for Bounded Branching VASS
F Mazowiecki, M Pilipczuk
arXiv preprint arXiv:1904.10226, 2019
2019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20