MST
2007
13 years 4 months ago
2007
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1...
MST
2007
13 years 4 months ago
2007
Abstract. We study the distribution of values of additive functions related to numeration systems defined via regular languages.
MST
2007
13 years 4 months ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
MST
2007
13 years 4 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
MST
2007
13 years 4 months ago
2007
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...