Sciweavers

2409 search results - page 131 / 482
» On Extended Regular Expressions
Sort
View
135
Voted
STACS
2009
Springer
15 years 11 months ago
Weak MSO with the Unbounding 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 desc...
Mikolaj Bojanczyk
AIIA
1999
Springer
15 years 8 months ago
Labelled Tableaux for Non-normal Modal Logics
In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular...
Guido Governatori, Alessandro Luppi
CORR
2008
Springer
65views Education» more  CORR 2008»
15 years 4 months ago
The Wadge Hierarchy of Deterministic Tree Languages
Abstract. We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decid...
Filip Murlak
CSL
2004
Springer
15 years 4 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 descrip...
Mikolaj Bojanczyk
ENTCS
2002
110views more  ENTCS 2002»
15 years 4 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat