Michał Skrzypczak

Available identifiers

zbMath Open skrzypczak.michalWikidataQ102431166 ScholiaQ102431166MaRDI QIDQ290906

List of research outcomes

Publication	Date of Publication	Type
On Guidable Index of Tree Automata	2023-08-08	Paper
Languages given by Finite Automata over the Unary Alphabet	2023-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q5092424	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5089242	2022-07-18	Paper
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	2022-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q5002827	2021-07-28	Paper
The uniform measure of simple regular sets of infinite trees	2021-06-03	Paper
Uniformisations of Regular Relations Over Bi-Infinite Words	2021-01-21	Paper
How Deterministic are Good-For-Games Automata?	2020-11-25	Paper
A Characterisation of Pi^0_2 Regular Tree Languages	2020-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q5232909	2019-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q5377469	2019-05-24	Paper
Büchi VASS recognise \(\mathbf{\Sigma}^{1}_{1}\)-complete \({\omega}\)-languages	2018-10-23	Paper
On the Strength of Unambiguous Tree Automata	2018-09-20	Paper
Monadic Second Order Logic with Measure and Category Quantifiers	2018-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q4608641	2018-03-21	Paper
Deciding the topological complexity of Büchi languages *	2017-12-19	Paper
Irregular behaviours for probabilistic automata	2017-10-27	Paper
Connecting decidability and complexity for MSO logic	2017-10-13	Paper
Measure properties of regular sets of trees	2017-09-28	Paper
The Logical Strength of Büchi's Decidability Theorem	2017-07-19	Paper
Index Problems for Game Automata	2017-07-13	Paper
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata	2017-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q2958515	2017-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q2957916	2017-01-30	Paper
Unambiguous Büchi Is Weak	2016-08-30	Paper
The logical strength of B\"uchi's decidability theorem	2016-08-26	Paper
Descriptive set theoretic methods in automata theory. Decidability and topological complexity	2016-08-05	Paper
Regular languages of thin trees	2016-06-03	Paper
Trading Bounds for Memory in Games with Counters	2015-11-04	Paper
On Determinisation of Good-for-Games Automata	2015-11-04	Paper
On the Weak Index Problem for Game Automata	2015-09-24	Paper
Measure Properties of Game Tree Languages	2014-10-14	Paper
On the Decidability of MSO+U on Infinite Trees	2014-07-01	Paper
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets	2014-04-15	Paper
Separation Property for wB- and wS-regular Languages	2014-03-24	Paper
Topological extension of parity automata	2013-12-19	Paper
Nondeterminism in the Presence of a Diverse or Unknown Future	2013-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q2909624	2012-09-06	Paper
On the Topological Complexity of MSO+U and Related Automata Models	2010-09-03	Paper
On the Borel Complexity of MSO Definable Sets of Branches	2010-05-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michał Skrzypczak