384 search results - page 16 / 77 » Equivalence Relations on Classes of Computable Structures |
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
SEFM
2007
IEEE
14 years 1 months ago
2007
IEEE
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...