815 search results - page 65 / 163 » Algebraic Recognizability of Languages |
169
click to vote
CAI
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
137
Voted
SIGPLAN
2002
15 years 5 months ago
2002
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
177
click to vote
IANDC
2010
15 years 3 months ago
2010
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
132
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
178
click to vote
SSDBM
1998
IEEE
15 years 10 months ago
1998
IEEE
We address the issue of designing effective query languages for OLAP databases. The basis of our investigation is MD, a new data model for multidimensional databases that, unlike ...