Connections between binary patterns and paperfolding
Patrick Morton (1990)
Journal de théorie des nombres de Bordeaux
Similarity:
Displaying similar documents to “A classification of periodic turtle sequences.”
Connections between binary patterns and paperfolding
Sequences of low arithmetical complexity
Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
Arithmetical complexity of a sequence is the number of words of length that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical complexity and describe the family of such words having lowest complexity.
A characterization of balanced episturmian sequences.
Paquin, Geneviève, Vuillon, Laurent (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Centroaffine invariants of plane curves in connection with the theory of the second-order linear differential equations
František Neuman (1968)
Archivum Mathematicum
Similarity:
Periodic solution of certain second order differential equation
Bahman Mehri (1980)
Archivum Mathematicum
Similarity:
Multiple periodic solutions to a suspension bridge O. D. E.
McKenna, P.J., Moore, K.S. (2000)
Electronic Journal of Differential Equations (EJDE) [electronic only]
Similarity:
Some Algebraic Properties of Machine Poset of Infinite Words
Aleksandrs Belovs (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.