Sciweavers

1399 search results - page 129 / 280
» Multi-party Finite Computations
Sort
View
JUCS
2002
106views more  JUCS 2002»
15 years 3 months ago
Additive Distances and Quasi-Distances Between Words
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
Cristian Calude, Kai Salomaa, Sheng Yu
119
Voted
DLT
2009
15 years 1 months ago
Subshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
Emmanuel Jeandel, Guillaume Theyssier
BIRTHDAY
2010
Springer
15 years 1 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche
CADE
2009
Springer
16 years 4 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
125
Voted
CAV
2009
Springer
135views Hardware» more  CAV 2009»
16 years 4 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf