scientific article

From MaRDI portal
Revision as of 06:39, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3659988

zbMath0514.20045MaRDI QIDQ3659988

M. Lothaire

Publication date: 1983


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Exponents of Diophantine approximation in dimension 2 for a general class of numbersIndeterminate string factorizations and degenerate text transformationsWord-representability of split graphs generated by morphismsFactorizing strings into repetitionsDynamical directions in numerationOn systems of word equations with simple loop setsA note on the number of squares in a wordTransposition invariant wordsConjugacy of morphisms and Lyndon decomposition of standard Sturmian wordsInfinite unfair shuffles and associativityWords that almost commuteA characterization of binary morphisms generating Lyndon infinite wordsEquations over the \(k\)-binomial monoidsAlgorithms for subsequence combinatoricsLong binary patterns are abelian 2-avoidableQuasiperiodic and Lyndon episturmian wordsExistence of finite test-sets for \(k\)-power-freeness of uniform morphismsOn a factorization of graded Hopf algebras using Lyndon words.PBW bases for a class of braided Hopf algebras.Constructions of free dibands and tribandsNew algebraic and geometric constructs arising from Fibonacci numbers.On the topological convergence of multi-rule sequences of sets and fractal patternsDescription of normal bases of boundary algebras and factor languages of slow growthSubshifts with leading sequences, uniformity of cocycles and spectra of Schreier graphsTwo strings at Hamming distance 1 cannot be both quasiperiodicEquations over free inverse monoids with idempotent variablesCan we recover the cover?A characterization of free pairs of upper triangular free monoid morphismsA new weighted Ihara zeta function for a graphAutomaton semigroups and groups: on the undecidability of problems related to freeness and finitenessExact and asymptotic enumeration of cyclic permutations according to descent setEuler-Mahonian triple set-valued statistics on permutationsWeighted Bartholdi zeta functions of graph coveringsRuelle zeta functions for finite digraphsThe identity problem of finitely generated bi-idealsOn new chaotic mappings in symbol spaceUniform convergence of Schrödinger cocycles over simple Toeplitz subshiftGeneralization of convolution and incidence algebrasIterated periodicity over finite aperiodic semigroupsTowards optimal packed string matchingSome weighted Bartholdi zeta function of a digraphA \(q\)-multinomial expansion of LLT coefficients and plethysm multiplicitiesOn generalized highly potential wordsCharacterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101Closest periodic vectors in \(L_p\) spacesConserved energies for the one dimensional Gross-Pitaevskii equationPermuting operations on strings and the distribution of their prime numbersAn efficient Gray code algorithm for generating all permutations with a given major indexAvoiding abelian powers cyclicallyLanguages with mismatchesPartial words and the critical factorization theorem revisitedFrom first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimizationAn extension of the Burrows-Wheeler transformAbelian closures of infinite binary wordsOn complexity of grammars related to the safety problemMirror substitutions and palindromic sequencesRelational codes of wordsFreeness of partial wordsQuasi-periodic continued fractionsPrefix-primitivity-preserving homomorphismsHybrid and generalized marked systemsOn an involution of Christoffel words and Sturmian morphismsShuffle operations on discrete pathsCompleting circular codes in regular submonoidsBreaking the rhythm on graphsReconstructing compositionsMonomial algebras defined by Lyndon words.A basis for the right quantum algebra and the ``\(1= q\) principleSmooth words on 2-letter alphabets having same parityUnbordered factors and Lyndon wordsConnections between subwords and certain matrix mappingsCounting bordered and primitive words with a fixed weightCommutation with codesPrimitive partial wordsWeighted Bartholdi zeta functions of graphsRecognizable subsets of some partially Abelian monoidsOn the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)Characteristic morphisms of generalized episturmian wordsOn systems of word equations over three unknowns with at most six occurrences of one of the unknownsSimple equations on binary factorial languagesBurrows-Wheeler transform and palindromic richnessHairpin structures defined by DNA trajectoriesOptimal bounds for computing \({\alpha}\)-gapped repeatsImplicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. SimonCartesian and Lyndon treesEmbedding a \(\theta \)-invariant code into a complete oneFinitely distinguishable erasing pattern languagesExtremal square-free wordsQueens in exile: non-attacking queens on infinite chess boardsFree monoids and generalized metric spacesOn the size of the smallest alphabet for Lyndon treesApproximate cover of stringsSome further results on squarefree arithmetic progressions in infinite wordsHow to play Thue gamesApproximate periodicityPerspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015)Classification of sub-Cuntz statesCharacterization of repetitions in Sturmian words: a new proofPrivileged factors in the Thue-Morse word -- a comparison of privileged words and palindromesRich square-free words







This page was built for publication: