119 search results - page 6 / 24 » On finite alphabets and infinite bases |
COMBINATORICA
2004
14 years 11 months ago
2004
In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales-Jewett Theorem in which the leftmost letters of all but one of the words were required to be vari...
77
Voted
DLT
2009
14 years 9 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
ENDM
2008
14 years 11 months ago
2008
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
ICMAS
2000
15 years 1 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
TIT
2002
14 years 11 months ago
2002
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...