default search action
Michal Skrzypczak
Person information
- unicode name: Michał Skrzypczak
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c32]Nathan Lhote
, Vincent Michielini
Uniformisation of Regular Relations in First-Order Logic with Two Variables. LICS 2024: 54:1-54:13 - [c31]Pierre Ohlmann, Michal Skrzypczak:
Positionality in Σ⁰₂ and a Completeness Result. STACS 2024: 54:1-54:18 - 2023
- [c30]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: 22:1-22:20 - [c29]Damian Niwinski, Pawel Parys
The Probabilistic Rabin Tree Theorem*. LICS 2023: 1-13 - [i20]Damian Niwinski, Pawel Parys, Michal Skrzypczak:
The Probabilistic Rabin Tree Theorem. CoRR abs/2304.12158 (2023) - [i19]Pierre Ohlmann, Michal Skrzypczak:
Positionality in Σ_0^2 and a completeness result. CoRR abs/2309.17022 (2023) - 2021
- [j15]Michal Skrzypczak, Piotr Hofman
Preface. Fundam. Informaticae 180(4) (2021) - [j14]Olivier Finkel, Michal Skrzypczak:
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words. Fundam. Informaticae 183(3-4): 243-291 (2021) - [j13]Marcin Przybylko, Michal Skrzypczak:
The uniform measure of simple regular sets of infinite trees. Inf. Comput. 278: 104595 (2021) - [c28]Lorenzo Clemente, Michal Skrzypczak:
Deterministic and Game Separability for Regular Languages of Infinite Trees. ICALP 2021: 126:1-126:15 - [c27]Damian Niwinski, Michal Skrzypczak:
On Guidable Index of Tree Automata. MFCS 2021: 81:1-81:14 - [i18]Lorenzo Clemente, Michal Skrzypczak:
Deterministic and game separability for regular languages of infinite trees. CoRR abs/2105.01137 (2021) - [i17]Olivier Finkel, Michal Skrzypczak:
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words. CoRR abs/2107.04025 (2021) - [i16]Thomas Colcombet, Karin Quaas, Michal Skrzypczak:
Unambiguity in Automata Theory (Dagstuhl Seminar 21452). Dagstuhl Reports 11(10): 57-71 (2021) - 2020
- [c26]Udi Boker, Denis Kuperberg
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS 2020: 41:1-41:13 - [c25]Damian Niwinski, Marcin Przybylko, Michal Skrzypczak
Computing Measures of Weak-MSO Definable Sets of Trees. ICALP 2020: 136:1-136:18 - [c24]Grzegorz Fabianski
Uniformisations of Regular Relations Over Bi-Infinite Words. LICS 2020: 384-396 - [c23]Vincent Michielini, Michal Skrzypczak
Regular Choice Functions and Uniformisations For countable Domains. MFCS 2020: 69:1-69:13 - [i15]Marcin Przybylko, Michal Skrzypczak:
The Uniform Measure of Simple Regular Sets of Infinite Trees. CoRR abs/2001.11576 (2020) - [i14]Udi Boker, Denis Kuperberg, Karoliina Lehtinen
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR abs/2002.07278 (2020) - [i13]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR abs/2009.14437 (2020)
2010 – 2019
- 2019
- [j12]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. Log. Methods Comput. Sci. 15(2) (2019) - [j11]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) - [c22]Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+∇ is undecidable. LICS 2019: 1-13 - [c21]Nathan Lhote, Vincent Michielini, Michal Skrzypczak:
Uniformisation Gives the Full Strength of Regular Languages. MFCS 2019: 61:1-61:13 - [e1]Piotrek Hofman
Developments in Language Theory - 23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, Proceedings. Lecture Notes in Computer Science 11647, Springer 2019, ISBN 978-3-030-24885-7 [contents] - [i12]Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+nabla is undecidable. CoRR abs/1901.06900 (2019) - 2018
- [j10]Henryk Michalewski, Michal Skrzypczak:
On the Strength of Unambiguous Tree Automata. Int. J. Found. Comput. Sci. 29(5): 911-933 (2018) - [j9]Matteo Mio, Michal Skrzypczak, Henryk Michalewski:
Monadic Second Order Logic with Measure and Category Quantifiers. Log. Methods Comput. Sci. 14(2) (2018) - [c20]Michal Skrzypczak:
Unambiguous Languages Exhaust the Index Hierarchy. ICALP 2018: 140:1-140:14 - [c19]Michal Skrzypczak
Büchi VASS Recognise ∑11-complete ω-languages. RP 2018: 133-145 - [i11]Michal Skrzypczak:
Unambiguous languages exhaust the index hierarchy. CoRR abs/1803.06163 (2018) - [i10]Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak:
Regular tree languages in low levels of Wadge Hierarchy. CoRR abs/1806.02041 (2018) - 2017
- [j8]Tomasz Gogacz, Henryk Michalewski, Matteo Mio
Measure properties of regular sets of trees. Inf. Comput. 256: 108-130 (2017) - [c18]Michal Skrzypczak:
Connecting Decidability and Complexity for MSO Logic. DLT 2017: 75-79 - [c17]Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata?. FSTTCS 2017: 18:1-18:14 - [c16]Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak:
A Characterisation of Pi^0_2 Regular Tree Languages. MFCS 2017: 56:1-56:14 - [i9]Henryk Michalewski, Matteo Mio, Michal Skrzypczak:
Monadic Second Order Logic with Measure and Category Quantifiers. CoRR abs/1702.04769 (2017) - [i8]Michal Skrzypczak:
Büchi VASS recognise w-languages that are Sigma^1_1 - complete. CoRR abs/1708.09658 (2017) - [i7]Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. CoRR abs/1709.03121 (2017) - [i6]Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata? CoRR abs/1710.04115 (2017) - 2016
- [b1]Michal Skrzypczak:
Descriptive Set Theoretic Methods in Automata Theory - Decidability and Topological Complexity. Lecture Notes in Computer Science 9802, Springer 2016, ISBN 978-3-662-52946-1, pp. 1-206 - [j7]Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk:
Regular Languages of Thin Trees. Theory Comput. Syst. 58(4): 614-663 (2016) - [j6]Alessandro Facchini
Index Problems for Game Automata. ACM Trans. Comput. Log. 17(4): 24 (2016) - [c15]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The Logical Strength of Büchi's Decidability Theorem. CSL 2016: 36:1-36:16 - [c14]Henryk Michalewski, Michal Skrzypczak:
Unambiguous Büchi Is Weak. DLT 2016: 319-331 - [c13]Michal Skrzypczak, Igor Walukiewicz:
Deciding the Topological Complexity of Büchi Languages. ICALP 2016: 99:1-99:13 - [c12]Marcin Przybylko, Michal Skrzypczak:
On the Complexity of Branching Games with Regular Conditions. MFCS 2016: 78:1-78:14 - [i5]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. CoRR abs/1608.07514 (2016) - 2015
- [c11]Nathanaël Fijalkow
Trading Bounds for Memory in Games with Counters. ICALP (2) 2015: 197-208 - [c10]Denis Kuperberg, Michal Skrzypczak:
On Determinisation of Good-for-Games Automata. ICALP (2) 2015: 299-310 - [c9]Nathanaël Fijalkow
Irregular Behaviours for Probabilistic Automata. RP 2015: 33-36 - [c8]Alessandro Facchini
On the Weak Index Problem for Game Automata. WoLLIC 2015: 93-108 - [i4]Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
Index problems for game automata. CoRR abs/1506.02153 (2015) - 2014
- [j5]Michal Skrzypczak:
Separation Property for wB- and wS-regular Languages. Log. Methods Comput. Sci. 10(1) (2014) - [j4]Olivier Finkel, Michal Skrzypczak
On the topological complexity of ω-languages of non-deterministic Petri nets. Inf. Process. Lett. 114(5): 229-233 (2014) - [c7]Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak:
On the Decidability of MSO+U on Infinite Trees. ICALP (2) 2014: 50-61 - [c6]Tomasz Gogacz, Henryk Michalewski, Matteo Mio
Measure Properties of Game Tree Languages. MFCS (1) 2014: 303-314 - [i3]Henryk Michalewski, Michal Skrzypczak:
Unambiguous Buchi is weak. CoRR abs/1401.4025 (2014) - [i2]Olivier Finkel, Michal Skrzypczak:
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. CoRR abs/1401.6835 (2014) - 2013
- [j3]Michal Skrzypczak:
Topological extension of parity automata. Inf. Comput. 228: 16-27 (2013) - [c5]Marcin Bilkowski, Michal Skrzypczak:
Unambiguity and uniformization problems on infinite trees. CSL 2013: 81-100 - [c4]Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak:
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) 2013: 89-100 - [c3]Alessandro Facchini
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. LICS 2013: 499-508 - [c2]Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak:
Regular languages of thin trees. STACS 2013: 562-573 - 2012
- [j2]Szczepan Hummel, Michal Skrzypczak:
The Topological Complexity of MSO+U and Related Automata Models. Fundam. Informaticae 119(1): 87-111 (2012) - 2011
- [i1]Michal Skrzypczak:
Equational theories of profinite structures. CoRR abs/1111.0476 (2011) - 2010
- [j1]Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich
On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Informaticae 98(4): 337-349 (2010) - [c1]Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk
On the Topological Complexity of MSO+U and Related Automata Models. MFCS 2010: 429-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: