Year: 2009
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Bojanczyk, Mikolaj
Institution: University of Warsaw
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2951961998