B\"uchi VASS recognise w-languages that are Sigma^1_1 - complete
Formal Languages and Automata Theory
2017-10-10 v2
Abstract
This short note exhibits an example of a Sigma^1_1-complete language that can be recognised by a one blind counter B\"uchi automaton (or equivalently a B\"uchi VASS with only one place).
Cite
@article{arxiv.1708.09658,
title = {B\"uchi VASS recognise w-languages that are Sigma^1_1 - complete},
author = {Michał Skrzypczak},
journal= {arXiv preprint arXiv:1708.09658},
year = {2017}
}