36 search results - page 3 / 8 » fsttcs 2009 |
FSTTCS
2009
Springer
13 years 9 months ago
2009
Springer
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We report on our experiences in redesigning Scala’s collection libraries, focussing on the role that type systems play in keeping software architectures coherent over time. Type ...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...