Seguir
Michał Skrzypczak
Michał Skrzypczak
Dirección de correo verificada de mimuw.edu.pl - Página principal
Título
Citado por
Citado por
Año
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
422015
The topological complexity of MSO+ U and related automata models
S Hummel, M Skrzypczak
Fundamenta Informaticae 119 (1), 87-111, 2012
342012
Nondeterminism in the presence of a diverse or unknown future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013
332013
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
On the decidability of MSO+ U on infinite trees
M Bojańczyk, T Gogacz, H Michalewski, M Skrzypczak
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
192014
Measure properties of game tree languages
T Gogacz, H Michalewski, M Mio, M Skrzypczak
Mathematical Foundations of Computer Science 2014: 39th International …, 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
172016
Monadic second order logic with measure and category quantifiers
H Michalewski, M Skrzypczak, M Mio
Logical Methods in Computer Science 14, 2018
132018
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
Mathematical Foundations of Computer Science 2010: 35th International …, 2010
132010
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
122010
Regular languages of thin trees
M Bojanczyk, T Idziaszek, M Skrzypczak
30th International Symposium on Theoretical Aspects of Computer Science …, 2013
112013
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
Separation Property for wB-and wS-regular Languages
M Skrzypczak
Logical Methods in Computer Science 10, 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
Trading bounds for memory in games with counters
N Fijalkow, F Horn, D Kuperberg, M Skrzypczak
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
92015
Descriptive set theoretic methods in automata theory
M Skrzypczak
Journal of [Online]. Available: http://www. mimuw. edu. pl/~ mskrzypczak …, 2014
92014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20