Sciweavers

CSL
2004
Springer

A Bounding Quantifier

13 years 3 months ago
A Bounding 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.
Mikolaj Bojanczyk
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CSL
Authors Mikolaj Bojanczyk
Comments (0)