224 search results - page 12 / 45 » Three New Algorithms for Regular Language Enumeration |
ICALP
2001
Springer
15 years 1 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
FOIKS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
ISMVL
2000
IEEE
15 years 1 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
174
click to vote
VLDB
2003
ACM
15 years 9 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...