Michał Skrzypczak

About Michał Skrzypczak

Michał Skrzypczak, With an exceptional h-index of 13 and a recent h-index of 8 (since 2020), a distinguished researcher at Uniwersytet Warszawski, specializes in the field of automata theory, descriptive set theory, logic.

His recent articles reflect a diverse array of research interests and contributions to the field:

Positionality in Σ⁰₂ and a Completeness Result

Positionality in {\Sigma} _0^ 2 and a completeness result

The Probabilistic Rabin Tree Theorem*

Languages given by finite automata over the unary alphabet

Unambiguity in automata theory (dagstuhl seminar 21452)

On the expressive power of non-deterministic and unambiguous petri nets over infinite words

UNIFORMISATION AND CHOICE QUESTIONS FOR REGULAR LANGUAGES

The uniform measure of simple regular sets of infinite trees

Michał Skrzypczak Information

University

Position

___

Citations(all)

456

Citations(since 2020)

277

Cited By

321

hIndex(all)

13

hIndex(since 2020)

8

i10Index(all)

18

i10Index(since 2020)

6

Email

University Profile Page

Google Scholar

Michał Skrzypczak Skills & Research Interests

automata theory

descriptive set theory

logic

Top articles of Michał Skrzypczak

Positionality in Σ⁰₂ and a Completeness Result

2024

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Positionality in {\Sigma} _0^ 2 and a completeness result

arXiv preprint arXiv:2309.17022

2023/9/29

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

The Probabilistic Rabin Tree Theorem*

2023/6/26

Paweł Parys
Paweł Parys

H-Index: 11

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Languages given by finite automata over the unary alphabet

2023/2/13

Unambiguity in automata theory (dagstuhl seminar 21452)

2022

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

On the expressive power of non-deterministic and unambiguous petri nets over infinite words

Fundamenta Informaticae

2021/12/23

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

UNIFORMISATION AND CHOICE QUESTIONS FOR REGULAR LANGUAGES

2021/9/13

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

The uniform measure of simple regular sets of infinite trees

Information and Computation

2021/6/1

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Deterministic and game separability for regular languages of infinite trees

arXiv preprint arXiv:2105.01137

2021/5/3

Lorenzo Clemente
Lorenzo Clemente

H-Index: 12

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

On guidable index of tree automata

2021

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

On the succinctness of alternating parity good-for-games automata

arXiv preprint arXiv:2009.14437

2020/9/29

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Uniformisations of regular relations over bi-infinite words

2020/7/8

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Szymon Toruńczyk
Szymon Toruńczyk

H-Index: 12

On succinctness and recognisability of alternating good-for-games automata

arXiv preprint arXiv:2002.07278

2020/2/17

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Regular Choice Functions and Uniformisations For countable Domains

2020

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Computing measures of weak-MSO definable sets of trees

2020

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

See List of Professors in Michał Skrzypczak University(Uniwersytet Warszawski)

Co-Authors

academic-engine