762 search results - page 72 / 153 » Intercode Regular Languages |
130
click to vote
ALT
2006
Springer
16 years 1 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
122
click to vote
DNA
2007
Springer
15 years 10 months ago
2007
Springer
We consider theoretical properties of the template-guided recombination operation. In particular, we consider the decidability of whether two sets of templates are equivalent, that...
124
click to vote
DELOS
2000
15 years 5 months ago
2000
We consider a query subscription system that can provide users with information about web changes that interest them. We present a query subscription language and a system that co...
236
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
129
click to vote
DBPL
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and t...