240 search results - page 6 / 48 » Infinite trace equivalence |
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
SAS
2000
Springer
14 years 7 days ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
APAL
2006
13 years 8 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
CSR
2006
Springer
14 years 11 days ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...