Weak Mso with the Unbounding Quantifier
Formal Languages and Automata Theory
2009-03-09 v1 Logic in Computer Science
Abstract
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of -regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic second-order logic with a bounding quantifier). Effective translations between the logic and automata are given.
Cite
@article{arxiv.0902.1042,
title = {Weak Mso with the Unbounding Quantifier},
author = {Mikolaj Bojanczyk},
journal= {arXiv preprint arXiv:0902.1042},
year = {2009}
}