Results 21 to 30 of about 49 (49)

Extremal Infinite Overlap-Free Binary Words [PDF]

, 1997
Let t be the infinite fixed point, starting with 1, of the morphism :0#01, 1 # 10. An infinite word over {0, 1} is said to be overlap-free if it contains no factor of the form axaxa, where a #{0,1}and x #{0,1} # . We prove that the lexicographically
Allouche, Jean-Paul, Shallit, Jeffrey, Currie, James D., Jean-paul Allouche, James Currie, Jeffrey Shallit   +5 more
core  

Theoretical Informatics and Applications Will be set by the publisher ON CONJUGACY OF LANGUAGES ∗

, 2008
. We say that two languages X and Y are conjugates if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated to this equation.
Ján Maňuch, Juhani Karhumäki, Julien Cassaigne   +2 more
core  

© Hindawi Publishing Corp. A CLASSIFICATION OF PERIODIC TURTLE SEQUENCES

, 2002
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.
J. Holdener, A. Wagaman
core  

A finite word poset

, 2000
Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of
David C. Torney, Péter L. Erdős, Péter Sziklai   +2 more
core  

Asymptotic Analysis of <i>q</i>-Recursive Sequences. [PDF]

Algorithmica, 2022
Heuberger C, Krenn D, Lipnik GF.
europepmc   +1 more source

Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

, 1996
We give efficient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest.
Frank Ruskey, Malcolm Smith, Andrzej Proskurowski   +2 more
core  

Staircase patterns in words: subsequences, subwords, and separation number. [PDF]

Eur J Comb, 2020
Mansour T, Rastegar R, Roitershtein A.
europepmc   +1 more source

Practical splitting methods for the adaptive integration of nonlinear evolution equations. Part I: Construction of optimized schemes and pairs of schemes. [PDF]

BIT Numer Math, 2017
Auzinger W, Hofstätter H, Ketcheson D, Koch O.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

JUVENAL MURWANASHYAKA. Papers on weak first-order theories and decidability problems , University of Oslo. 2023. Supervised by Lars Kristiansen, Dag Normann, and Tom Lindstrøm. MSC: 03B10, 03B25, 03D35, 03D40, 03F25, 03F30, 68R15. Keywords: decidability, interpretability, sequential theories, weak arithmetic.

The Bulletin of Symbolic Logic
Abstract The dissertation consists of an introductory chapter and eight published articles centered around the following topics: (1) calibration of the interpretability strength of weak first-order theories; (2) determination of the (un)decidability of fine-grained fragments of the intended models of the ...
openaire   +1 more source

Complexité et facteurs spéciaux

Bulletin of the Belgian Mathematical Society - Simon Stevin, 1997
Julien Cassaigne
exaly