A cellular automaton on a torus.
Cobeli, C.I., Crâşmaru, M., Zaharescu, A. (2000)
Portugaliae Mathematica
Similarity:
Displaying similar documents to “The problem as a string rewriting system.”
A cellular automaton on a torus.
On symmetric and antisymmetric balanced binary sequences.
Eliahou, Shalom, Hachez, Delphine (2005)
Integers
Similarity:
Sloping binary numbers: a new sequence related to the binary numbers.
Applegate, David, Cloitre, Benoit, Deléham, Philippe, Sloane, N.J.A. (2005)
Journal of Integer Sequences [electronic only]
Similarity:
Numerical analogues of Aronson's sequence.
Cloitre, Benoit, Sloane, N. J. A., Vandermast, Matthew J. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
On the D0L Repetition Threshold
Ilya Goldstein (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
The repetition threshold is a measure of the extent to which there need to be consecutive (partial) repetitions of finite words within infinite words over alphabets of various sizes. Dejean's Conjecture, which has been recently proven, provides this threshold for all alphabet sizes. Motivated by a question of Krieger, we deal here with the analogous threshold when the infinite word is restricted to be a D0L word. Our main result is that, asymptotically, this threshold does not exceed...
Regularity properties of the Stern enumeration of the rationals.
Reznick, Bruce (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Counting the number of unavoidable sets of a given size in a finite set of integers.
Mills, Donald, Mitchell, Patrick (2005)
Integers
Similarity:
Restricted walks in regular trees.
Ciobanu, Laura, Radomirović, Saša (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cross-correlation properties of Costas arrays and their images under horizontal and vertical flips.
Drakakis, Konstantinos, Gow, Rod, Healy, John, Rickard, Scott (2008)
Mathematical Problems in Engineering
Similarity:
Dynamic programming for reduced NFAs for approximate string and sequence matching
Jan Holub (2002)
Kybernetika
Similarity:
searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given...
Divisibility by 2 and 3 of certain Stirling numbers.
Davis, Donald M. (2008)
Integers
Similarity: