110 search results - page 10 / 22 » Self-Referencing Languages Revisited |
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
ACTA
2007
13 years 7 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
DBPL
2009
Springer
14 years 2 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...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
LICS
2003
IEEE
14 years 27 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...