Sciweavers

240 search results - page 20 / 48
» Infinite trace equivalence
Sort
View
FOCM
2002
140views more  FOCM 2002»
13 years 8 months ago
Adaptive Wavelet Methods II - Beyond the Elliptic Case
This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability...
Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore
ICALP
1999
Springer
14 years 28 days ago
Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
Antonín Kucera, Richard Mayr
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
14 years 9 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
DLT
2010
13 years 8 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
Sylvia Friese, Helmut Seidl, Sebastian Maneth
ACS
2010
13 years 8 months ago
Fibrations of Simplicial Sets
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
Tibor Beke