Weak MSO with the Unbounding Quantifier

Abstract. A new class of languages of infinite words is introduced, called the maxregular 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.

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Mikolaj Bojanczyk
• Keywords: Deterministic Counter Automaton, Maxregular Languages, Monadic Second-order Logic, STACS 2009, Theoretical Computer Science