815 search results - page 40 / 163 » Algebraic Recognizability of Languages |
127
click to vote
CTCS
1989
Springer
15 years 10 months ago
1989
Springer
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
141
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Formal semantics for XQuery with side-effects have been proposed in [13, 16]. We propose a different semantics which is better suited for database compilation. We substan...
171
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...
146
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
120
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...