Sciweavers

127 search results - page 23 / 26
» Algebraic Characterization of Logically Defined Tree Languag...
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
IGPL
2008
124views more  IGPL 2008»
13 years 7 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
CPHYSICS
2006
85views more  CPHYSICS 2006»
13 years 7 months ago
Simulation of n-qubit quantum systems. II. Separability and entanglement
Studies on the entanglement of n-qubit quantum systems have attracted a lot of interest during recent years. Despite the central role of entanglement in quantum information theory...
T. Radtke, S. Fritzsche
EDBT
2002
ACM
145views Database» more  EDBT 2002»
14 years 7 months ago
Incremental Maintenance of Schema-Restructuring Views
An important issue in data integration is the integration of semantically equivalent but schematically heterogeneous data sources. Declarative mechanisms supporting powerful source...
Andreas Koeller, Elke A. Rundensteiner
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard