170 search results - page 1 / 34 » A Bounding Quantifier |
83
Voted
CSL
2004
Springer
15 years 5 days ago
2004
Springer
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 descrip...
ECCC
2008
15 years 12 days ago
2008
101
Voted
CSL
2006
Springer
15 years 4 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
126
click to vote
CASC
2009
Springer
15 years 1 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
92
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
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...