762 search results - page 53 / 153 » Intercode Regular Languages |
117
click to vote
STACS
2009
Springer
15 years 9 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...
123
click to vote
STACS
2009
Springer
15 years 9 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
238
click to vote
ECOOP
2009
Springer
16 years 3 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
106
click to vote
SWAT
1998
Springer
15 years 6 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
126
click to vote
EPIA
1995
Springer
15 years 6 months ago
1995
Springer
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...