Michal Skrzypczak

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