Weak MSO with the Unbounding Quantifier

Authors:
Mikołaj Bojańczyk
Affiliations:
University of Warsaw, Warsaw, Poland
Venue:
Theory of Computing Systems
Year:
2011

Citing 0
Cited 2

The Topological Complexity of MSO+U and Related Automata Models

Fundamenta Informaticae - Emergent Computing
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.