paper

Büchi VASS recognise w-languages that are Sigma^1_1 - complete

arXiv:1708.09658

Abstract

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).