| On determinisation of good-for-games automata D Kuperberg, M Skrzypczak International Colloquium on Automata, Languages, and Programming, 299-310, 2015 | 63 | 2015 |
| 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 | 40 | 2013 |
| The topological complexity of MSO+ U and related automata models S Hummel, M Skrzypczak Fundamenta Informaticae 119 (1), 87-111, 2012 | 36 | 2012 |
| How deterministic are good-for-games automata? U Boker, O Kupferman, M Skrzypczak arXiv preprint arXiv:1710.04115, 2017 | 30 | 2017 |
| 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 | 22 | 2013 |
| 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 | 20 | 2019 |
| 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 | 19 | 2014 |
| 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 | 18 | 2018 |
| 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 | 17 | 2014 |
| Deciding the topological complexity of Büchi languages M Skrzypczak, I Walukiewicz ICALP 55, 99: 1--99: 13, 2016 | 14 | 2016 |
| Descriptive set theoretic methods in automata theory M Skrzypczak Journal of [Online]. Available: http://www. mimuw. edu. pl/~ mskrzypczak …, 2014 | 14 | 2014 |
| Unambiguity and uniformization problems on infinite trees M Bilkowski, M Skrzypczak Computer Science Logic 2013 (CSL 2013), 2013 | 14 | 2013 |
| Regular languages of thin trees M Bojanczyk, T Idziaszek, M Skrzypczak 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 14 | 2013 |
| 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 | 13 | 2010 |
| On the topological complexity of ω-languages of non-deterministic Petri nets O Finkel, M Skrzypczak Information Processing Letters 114 (5), 229-233, 2014 | 12 | 2014 |
| 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 | 12 | 2010 |
| Measure properties of regular sets of trees T Gogacz, H Michalewski, M Mio, M Skrzypczak Information and Computation 256, 108-130, 2017 | 11 | 2017 |
| Regular languages of thin trees T Idziaszek, M Skrzypczak, M Bojańczyk Theory of Computing Systems 58 (4), 614-663, 2016 | 11 | 2016 |
| On the succinctness of alternating parity good-for-games automata U Boker, D Kuperberg, K Lehtinen, M Skrzypczak arXiv preprint arXiv:2009.14437, 2020 | 10 | 2020 |
| Index problems for game automata A Facchini, F Murlak, M Skrzypczak ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016 | 10 | 2016 |
Henryk MichalewskiGoogle在 google.com 的电子邮件经过验证
