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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Deterministic Automata and Extensions of Weak MSO
Sort
relevance
views
votes
recent
update
View
thumb
title
76
click to vote
FSTTCS
2009
Springer
131
views
Software Engineering
»
more
FSTTCS 2009
»
Deterministic Automata and Extensions of Weak MSO
15 years 9 months ago
Download
www.mimuw.edu.pl
Mikolaj Bojanczyk, Szymon Torunczyk
claim paper
Read More »
121
Voted
STACS
2009
Springer
98
views
Theoretical Computer Science
»
more
STACS 2009
»
Weak MSO with the Unbounding Quantifier
15 years 9 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 »
« Prev
« First
page 1 / 1
Last »
Next »