The following pages link to Michał Skrzypczak (Q290906):
Displayed 41 items.
- Regular languages of thin trees (Q290908) (← links)
- Topological extension of parity automata (Q388217) (← links)
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity (Q737116) (← links)
- Irregular behaviours for probabilistic automata (Q1675145) (← links)
- Büchi VASS recognise \(\mathbf{\Sigma}^{1}_{1}\)-complete \({\omega}\)-languages (Q1798916) (← links)
- The uniform measure of simple regular sets of infinite trees (Q2029602) (← links)
- Measure properties of regular sets of trees (Q2407093) (← links)
- Connecting decidability and complexity for MSO logic (Q2408793) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- (Q2909624) (← links)
- Measure Properties of Game Tree Languages (Q2922025) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- (Q2957916) (← links)
- (Q2958515) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- On the Borel Complexity of MSO Definable Sets of Branches (Q3561217) (← links)
- On the Topological Complexity of MSO+U and Related Automata Models (Q3586103) (← links)
- Deciding the topological complexity of Büchi languages * (Q4598240) (← links)
- (Q4608641) (← links)
- Monadic Second Order Logic with Measure and Category Quantifiers (Q4637695) (← links)
- On the Strength of Unambiguous Tree Automata (Q4683238) (← links)
- (Q5002827) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- (Q5089242) (← links)
- (Q5092424) (← links)
- A Characterisation of Pi^0_2 Regular Tree Languages (Q5111272) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- Uniformisations of Regular Relations Over Bi-Infinite Words (Q5145649) (← links)
- On the Decidability of MSO+U on Infinite Trees (Q5167826) (← links)
- (Q5232909) (← links)
- Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (Q5271087) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- The Logical Strength of Büchi's Decidability Theorem (Q5278425) (← links)
- Nondeterminism in the Presence of a Diverse or Unknown Future (Q5327425) (← links)
- (Q5377469) (← links)
- Separation Property for wB- and wS-regular Languages (Q5404473) (← links)
- On Guidable Index of Tree Automata (Q6113369) (← links)
- The logical strength of B\"uchi's decidability theorem (Q6276899) (← links)
- Languages given by Finite Automata over the Unary Alphabet (Q6426329) (← links)