Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
34
click to vote
STACS
2009
Springer
98
views
Theoretical Computer Science
»
more
STACS 2009
»
Weak MSO with the Unbounding Quantifier
14 years 7 months ago
Download
hal.archives-ouvertes.fr
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 desc...
Mikolaj Bojanczyk
claim paper
Read More »