Michał Skrzypczak
Michał Skrzypczak
Verifisert e-postadresse på mimuw.edu.pl - Startside
Tittel
Sitert av
Sitert av
År
The topological complexity of MSO+ U and related automata models
S Hummel, M Skrzypczak
Fundamenta Informaticae 119 (1), 87-111, 2012
322012
Nondeterminism in the presence of a diverse or unknown future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 89-100, 2013
272013
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 299-310, 2015
252015
Rabin-Mostowski index problem: a step beyond deterministic automata
A Facchini, F Murlak, M Skrzypczak
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 499-508, 2013
222013
How Deterministic are Good-For-Games Automata?
U Boker, O Kupferman, M Skrzypczak
arXiv preprint arXiv:1710.04115, 2017
212017
Measure properties of game tree languages
T Gogacz, H Michalewski, M Mio, M Skrzypczak
International Symposium on Mathematical Foundations of Computer Science, 303-314, 2014
182014
On the decidability of MSO+ U on infinite trees
M Bojańczyk, T Gogacz, H Michalewski, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 50-61, 2014
182014
The logical strength of B\" uchi's decidability theorem
L Kołodziejczyk, H Michalewski, P Pradic, M Skrzypczak
arXiv preprint arXiv:1608.07514, 2016
142016
Deciding the topological complexity of Büchi languages
M Skrzypczak, I Walukiewicz
ICALP 55, 99: 1--99: 13, 2016
132016
Unambiguity and uniformization problems on infinite trees
M Bilkowski, M Skrzypczak
Computer Science Logic 2013 (CSL 2013), 2013
132013
On the topological complexity of MSO+ U and related automata models
S Hummel, M Skrzypczak, S Toruńczyk
International Symposium on Mathematical Foundations of Computer Science, 429-440, 2010
122010
Monadic second order logic with measure and category quantifiers
H Michalewski, M Skrzypczak, M Mio
Logical Methods in Computer Science 14, 2018
112018
Regular languages of thin trees
M Bojanczyk, T Idziaszek, M Skrzypczak
30th International Symposium on Theoretical Aspects of Computer Science …, 2013
112013
On the Borel complexity of MSO definable sets of branches
M Bojańczyk, D Niwiński, A Rabinovich, A Radziwończyk-Syta, ...
Fundamenta Informaticae 98 (4), 337-349, 2010
112010
Index problems for game automata
A Facchini, F Murlak, M Skrzypczak
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016
102016
On the topological complexity of ω-languages of non-deterministic Petri nets
O Finkel, M Skrzypczak
Information Processing Letters 114 (5), 229-233, 2014
102014
On the complexity of branching games with regular conditions
M Przybylko, M Skrzypczak
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
92016
Separation Property for wB-and wS-regular Languages
M Skrzypczak
arXiv preprint arXiv:1401.3214, 2014
92014
Measure properties of regular sets of trees
T Gogacz, H Michalewski, M Mio, M Skrzypczak
Information and Computation 256, 108-130, 2017
82017
Regular languages of thin trees
T Idziaszek, M Skrzypczak, M Bojańczyk
Theory of Computing Systems 58 (4), 614-663, 2016
82016
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20