1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.FL2020
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…
cs.FL2017★ 1 cited
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…