6 citations · 7 across the 3 of their papers we have counts for
4 papers
The Uniform Measure of Simple Regular Sets of Infinite Trees
Marcin Przybyłko, Michał Skrzypczak
We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be c…
Büchi VASS recognise w-languages that are Sigma^1_1 - complete
Michał Skrzypczak
This short note exhibits an example of a Sigma^1_1-complete language that can be recognised by a one blind counter Büchi automaton (or equivalently a Büchi VASS with only one place…
Separation Property for wB- and wS-regular Languages
Michał Skrzypczak
In this paper we show that ωB- and ωS-regular languages satisfy the following separation-type theorem If L1,L2 are disjoint languages of ω-words both recognised by ωB- (resp. ωS)-a…
Equational theories of profinite structures
Michał Skrzypczak
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g…