Weak MSO with the Unbounding Quantifier - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Weak MSO with the Unbounding Quantifier

Mikolaj Bojanczyk
  • Function : Author
  • PersonId : 835905


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.
Fichier principal
Vignette du fichier
bojanczyk_new.pdf (213.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359061 , version 1 (05-02-2009)


  • HAL Id : inria-00359061 , version 1
  • ARXIV : 0902.1042


Mikolaj Bojanczyk. Weak MSO with the Unbounding Quantifier. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.159-170. ⟨inria-00359061⟩


35 View
202 Download



Gmail Facebook X LinkedIn More