Results 11 to 20 of about 49 (49)

Hidden automatic sequences [PDF]

, 2021
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, morphic sequences are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where an, a priori, morphic sequence
Allouche, Jean-Paul, Queffélec, Martine, Dekking, Michel   +2 more
core   +1 more source

Mathematics Subject Classification interrater agreement dataset

, 2022
The Mathematics Subject Classification organizes Publications, Software, and Research Data into a hierarchical classification scheme maintained by MathSciNet (mr) and zbMATH Open (zbmath). According to the classification scheme, both organizations mr and
Olaf Teschke, Mark-Christoph Müller, Moritz Schubotz   +2 more
core   +1 more source

A classification of periodic turtle sequences

International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 34, Page 2193-2201, 2003., 2003
A turtle sequence is a word constructed from an alphabet of two letters: F, which represents the forward motion of a turtle in the plane, and L, which represents a counterclockwise turn. In this paper, we investigate such sequences and establish links between the combinatoric properties of words and the geometric properties of the curves they generate.
J. Holdener, A. Wagaman
wiley   +1 more source

THE AUTOMORPHISM GROUP OF A SHIFT OF LINEAR GROWTH: BEYOND TRANSITIVITY

Forum of Mathematics, Sigma, 2015
For a finite alphabet ${\mathcal{A}}$ and shift $X\subseteq {\mathcal{A}}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group $\text{Aut}(X)$.
VAN CYR, BRYNA KRA
doaj   +1 more source

Sorting inversion sequences [PDF]

Discrete Mathematics & Theoretical Computer Science
We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks.
Toufik Mansour, Howard Skogman, Rebecca Smith   +2 more
doaj   +1 more source

$\mathcal{S}$-adic characterization of minimal dendric shifts [PDF]

Discrete Mathematics & Theoretical Computer Science
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange ...
France Gheeraert, Julien Leroy
doaj   +1 more source

Comparison of alignment free string distances for complete genome phylogeny

, 2009
Phylogeny, String distances, Complete bacterial genomes, 05C05, 68R15, 90C27, 92B10,
Alain Guénoche, Guyon, F., Guénoche, A., Guyon, Frédéric, Guénoche, Alain, Frédéric Guyon, Brochier-Armanet, Céline, Céline Brochier-Armanet   +7 more
core   +1 more source

Computing longest previous factor in linear time and applications

, 2008
. We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of the longest factor of w starting at position i that occurs previously in w.
Ilie, L, Ilie, Lucian, Maxime Crochemore, Crochemore, M, Lucian Ilie, Crochemore, Maxime   +5 more
core   +1 more source

On the number of squares in a finite word [PDF]

Let \(u\) be a nonempty finite word, a square is a word of the form \(uu\). In this paper, we prove that for a given finite word \(w\), the number of distinct square factors of \(w\) is bounded by \(|w|-|\operatorname{Alph}(w)|\), where \(|w|\) denotes ...
Li, Shuo, Brlek, Srečko
core   +1 more source

Undecidability of Infinite Post Correspondence Problem for Instances of Size 9

, 2005
. In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by Ruohonen
Tero Harju, Harju, Tero, Halava, Vesa, Vesa Halava   +3 more
core   +1 more source