Theo dõi
Michał Skrzypczak
Michał Skrzypczak
Uniwersytet Warszawski
Email được xác minh tại mimuw.edu.pl - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 299-310, 2015
722015
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
482013
The topological complexity of MSO+ U and related automata models
S Hummel, M Skrzypczak
Fundamenta Informaticae 119 (1), 87-111, 2012
382012
How deterministic are good-for-games automata?
U Boker, O Kupferman, M Skrzypczak
arXiv preprint arXiv:1710.04115, 2017
342017
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
242013
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
212014
The logical strength of B\" uchi's decidability theorem
L Kołodziejczyk, H Michalewski, P Pradic, M Skrzypczak
Logical Methods in Computer Science 15, 2019
202019
Monadic second order logic with measure and category quantifiers
M Mio, M Skrzypczak, H Michalewski
Logical Methods in Computer Science 14 (Automata and logic), 2018
182018
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
172014
Deciding the topological complexity of Büchi languages
M Skrzypczak, I Walukiewicz
ICALP 55, 99: 1--99: 13, 2016
162016
Unambiguity and uniformization problems on infinite trees
M Bilkowski, M Skrzypczak
Computer Science Logic 2013 (CSL 2013), 81-100, 2013
152013
On the succinctness of alternating parity good-for-games automata
U Boker, D Kuperberg, K Lehtinen, M Skrzypczak
arXiv preprint arXiv:2009.14437, 2020
142020
Descriptive set theoretic methods in automata theory: decidability and topological complexity
M Skrzypczak
Springer, 2016
142016
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
142010
Regular languages of thin trees
T Idziaszek, M Skrzypczak, M Bojańczyk
Theory of Computing Systems 58 (4), 614-663, 2016
132016
On the topological complexity of ω-languages of non-deterministic Petri nets
O Finkel, M Skrzypczak
Information Processing Letters 114 (5), 229-233, 2014
132014
Measure properties of regular sets of trees
T Gogacz, H Michalewski, M Mio, M Skrzypczak
Information and Computation 256, 108-130, 2017
122017
Regular languages of thin trees
M Bojańczyk, T Idziaszek, M Skrzypczak
STACS 2013 20, 562-573, 2013
122013
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
Index problems for game automata
A Facchini, F Murlak, M Skrzypczak
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016
102016
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20