B\"uchi VASS recognise w-languages that are Sigma11 - complete
Abstract
This short note exhibits an example of a Sigma11-complete language that can be recognised by a one blind counter B\"uchi automaton (or equivalently a B\"uchi VASS with only one place).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.