Michal Skrzypczak

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 52

Top Topics

Regular Languages

Weighted Majority

Top Venues

Publications

Pierre Ohlmann, Michal Skrzypczak
Positionality in Σ⁰₂ and a Completeness Result. STACS (2024)
Nathan Lhote, Vincent Michielini, Michal Skrzypczak
Uniformisation of Regular Relations in First-Order Logic with Two Variables. LICS (2024)
Damian Niwinski, Pawel Parys, Michal Skrzypczak
The Probabilistic Rabin Tree Theorem. CoRR (2023)
Damian Niwinski, Pawel Parys, Michal Skrzypczak
. LICS (2023)
Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS (2023)
Pierre Ohlmann, Michal Skrzypczak
Positionality in Σ_0^2 and a completeness result. CoRR (2023)
Olivier Finkel, Michal Skrzypczak
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words. CoRR (2021)
Lorenzo Clemente, Michal Skrzypczak
Deterministic and game separability for regular languages of infinite trees. CoRR (2021)
Olivier Finkel, Michal Skrzypczak
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words. Fundam. Informaticae 183 (3-4) (2021)
Damian Niwinski, Michal Skrzypczak
On Guidable Index of Tree Automata. MFCS (2021)
Marcin Przybylko, Michal Skrzypczak
The uniform measure of simple regular sets of infinite trees. Inf. Comput. 278 (2021)
Michal Skrzypczak, Piotr Hofman
Preface. Fundam. Informaticae 180 (4) (2021)
Lorenzo Clemente, Michal Skrzypczak
Deterministic and Game Separability for Regular Languages of Infinite Trees. ICALP (2021)
Thomas Colcombet, Karin Quaas, Michal Skrzypczak
Unambiguity in Automata Theory (Dagstuhl Seminar 21452). Dagstuhl Reports 11 (10) (2021)
Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk
Uniformisations of Regular Relations Over Bi-Infinite Words. LICS (2020)
Vincent Michielini, Michal Skrzypczak
Regular Choice Functions and Uniformisations For countable Domains. MFCS (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR (2020)
Damian Niwinski, Marcin Przybylko, Michal Skrzypczak
Computing Measures of Weak-MSO Definable Sets of Trees. ICALP (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS (2020)
Marcin Przybylko, Michal Skrzypczak
The Uniform Measure of Simple Regular Sets of Infinite Trees. CoRR (2020)
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
MSO+∇ is undecidable. LICS (2019)
Nathan Lhote, Vincent Michielini, Michal Skrzypczak
Uniformisation Gives the Full Strength of Regular Languages. MFCS (2019)
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
Regular tree languages in low levels of the Wadge Hierarchy. Log. Methods Comput. Sci. 15 (3) (2019)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak
The logical strength of Büchi's decidability theorem. Log. Methods Comput. Sci. 15 (2) (2019)
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
MSO+nabla is undecidable. CoRR (2019)
Henryk Michalewski, Michal Skrzypczak
On the Strength of Unambiguous Tree Automata. Int. J. Found. Comput. Sci. 29 (5) (2018)
Matteo Mio, Michal Skrzypczak, Henryk Michalewski
Monadic Second Order Logic with Measure and Category Quantifiers. Log. Methods Comput. Sci. 14 (2) (2018)
Michal Skrzypczak
-complete ω-languages. RP (2018)
Michal Skrzypczak
Unambiguous Languages Exhaust the Index Hierarchy. ICALP (2018)
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
Regular tree languages in low levels of Wadge Hierarchy. CoRR (2018)
Michal Skrzypczak
Unambiguous languages exhaust the index hierarchy. CoRR (2018)
Udi Boker, Orna Kupferman, Michal Skrzypczak
How Deterministic are Good-For-Games Automata? CoRR (2017)
Michal Skrzypczak
Büchi VASS recognise w-languages that are Sigma^1_1 - complete. CoRR (2017)
Michal Skrzypczak
Connecting Decidability and Complexity for MSO Logic. DLT (2017)
Udi Boker, Orna Kupferman, Michal Skrzypczak
How Deterministic are Good-For-Games Automata?. FSTTCS (2017)
Henryk Michalewski, Matteo Mio, Michal Skrzypczak
Monadic Second Order Logic with Measure and Category Quantifiers. CoRR (2017)
Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak
A Characterisation of Pi^0_2 Regular Tree Languages. MFCS (2017)
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
Trading Bounds for Memory in Games with Counters. CoRR (2017)
Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak
Measure properties of regular sets of trees. Inf. Comput. 256 (2017)
Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk
Regular Languages of Thin Trees. Theory Comput. Syst. 58 (4) (2016)
Alessandro Facchini, Filip Murlak, Michal Skrzypczak
Index Problems for Game Automata. ACM Trans. Comput. Log. 17 (4) (2016)
Michal Skrzypczak, Igor Walukiewicz
Deciding the Topological Complexity of Büchi Languages. ICALP (2016)
Henryk Michalewski, Michal Skrzypczak
Unambiguous Büchi Is Weak. DLT (2016)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak
The logical strength of Büchi's decidability theorem. CoRR (2016)
Marcin Przybylko, Michal Skrzypczak
On the Complexity of Branching Games with Regular Conditions. MFCS (2016)
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, Michal Skrzypczak
The Logical Strength of Büchi's Decidability Theorem. CSL (2016)
Denis Kuperberg, Michal Skrzypczak
On Determinisation of Good-for-Games Automata. ICALP (2) (2015)
Alessandro Facchini, Filip Murlak, Michal Skrzypczak
Index problems for game automata. CoRR (2015)
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
Trading Bounds for Memory in Games with Counters. ICALP (2) (2015)
Alessandro Facchini, Filip Murlak, Michal Skrzypczak
On the Weak Index Problem for Game Automata. WoLLIC (2015)
Nathanaël Fijalkow, Michal Skrzypczak
Irregular Behaviours for Probabilistic Automata. RP (2015)
Olivier Finkel, Michal Skrzypczak
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. CoRR (2014)
Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak
On the Decidability of MSO+U on Infinite Trees. ICALP (2) (2014)
Henryk Michalewski, Michal Skrzypczak
Unambiguous Buchi is weak. CoRR (2014)
Michal Skrzypczak
Separation Property for wB- and wS-regular Languages. Log. Methods Comput. Sci. 10 (1) (2014)
Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak
Measure Properties of Game Tree Languages. MFCS (1) (2014)
Olivier Finkel, Michal Skrzypczak
On the topological complexity of ω-languages of non-deterministic Petri nets. Inf. Process. Lett. 114 (5) (2014)
Alessandro Facchini, Filip Murlak, Michal Skrzypczak
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. LICS (2013)
Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak
Regular languages of thin trees. STACS (2013)
Marcin Bilkowski, Michal Skrzypczak
Unambiguity and uniformization problems on infinite trees. CSL (2013)
Michal Skrzypczak
Topological extension of parity automata. Inf. Comput. 228 (2013)
Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) (2013)
Szczepan Hummel, Michal Skrzypczak
The Topological Complexity of MSO+U and Related Automata Models. Fundam. Informaticae 119 (1) (2012)
Michal Skrzypczak
Equational theories of profinite structures CoRR (2011)
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak
On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Informaticae 98 (4) (2010)
Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk
On the Topological Complexity of MSO+U and Related Automata Models. MFCS (2010)