Unending chess, symbolic dynamics and a problem in semi-groups

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

Publication:2653273

DOI10.1215/S0012-7094-44-01101-4zbMath0063.04115WikidataQ101082553 ScholiaQ101082553MaRDI QIDQ2653273

Marston Morse

Publication date: 1944

Published in: Duke Mathematical Journal (Search for Journal in Brave)




Related Items (76)

Rational languages and the Burnside problemTiling and local rank properties of the Morse sequenceGeneration of symmetric exponential sumsA separation between RLSLPs and LZ77On the context-freeness of the set of words containing overlapsExponential lower bounds for the number of words of uniform length avoiding a patternFunctionally recursive rings of matrices -- two examplesSul problema di Burnside per i semigruppi e i linguaggiWhich graphs allow infinite nonrepetitive walks?Multidimensional unrepetitive configurationsThe complexity of unavoidable word patternsAperiodic sequences and aperiodic geodesicsClassification of limit varieties of 𝒥-trivial monoidsSquarefree words with interior disposable factorsUndecidability of the identity problem for finite semigroupsSome combinatorial properties of the Thue-Morse sequence and a problem in semigroupsOn the flips for a synchronized systemEnumeration of irreducible binary wordsThe combinatorial degrees of proofs and equationsBinary words avoided by the Thue-Morse sequenceInfinite 0-1 sequences without long adjacent identical blocksProperties of infinite words : Recent resultsFunctions Whose Derivatives at One Point Form a Finite SetSelf-similarity and spectral theory: on the spectrum of substitutionsMots sans carre et morphismes iterésThe Morse sequence and iterated morphismsGrowth problems for avoidable wordsNon-repetitive words relative to a rewriting systemCancellation in semigroups in which \(x^ 2=x^ 3\)Restricted Burnside problem for semigroups and its application to language theoryMarkov diagrams for some non-Markovian systemsSome Problems Connected with the Thue–Morse and Fibonacci SequencesAvoiding Abelian squares in partial wordsEvery finite semigroup is embeddable in a finite relatively free semigroup.Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden wordsWORD COMPLEXITY AND REPETITIONS IN WORDSLocal Squares, Periodicity and Finite AutomataThue type problems for graphs, points, and numbersOn square-free arithmetic progressions in infinite wordsA new solution for Thue's problemAnnihilators in Nonrepetitive SemigroupsA Characterization of the Morse Minimal SetUnnamed ItemThe Burnside problem for semigroupsLocally testable semigroupsChains and fixing blocks in irreducible binary sequencesBounded AFLsInfinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphismLimit varieties of \(J\)-trivial monoidsOverlap-freeness in infinite partial wordsA characterization of the Morse minimal set up to topological conjugacyWORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISMOverlap-free words and finite automataOn the factors of the Thue-Morse word on three symbolsON THE REPETITIVITY INDEX OF INFINITE WORDSErgodic setsTHE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLEEnumeration of factors in the Thue-Morse wordFinite semigroups whose varieties have uncountably many subvarietiesSur un théorème de ThueWHEN THUE-MORSE MEETS KOCHMarston Morse and his mathematical worksOn some bounded semiAFLs and AFLsInequalities characterizing standard Sturmian and episturmian wordsA study on global stabilization of periodic orbits in discrete-time chaotic systems by using symbolic dynamicsSome further results on squarefree arithmetic progressions in infinite wordsNotions of densenessA propos d'une conjecture de F. Dejean sur les répétitions dans les motsTowards a General Concept of HypercodesOn the Burnside problem for semigroupsA characterization of overlap-free morphismsOn the centers of the set of weakly square-free words on a two letter alphabetOn regularity of languages generated by copying systemsThe lattice of varieties of monoidsSequences generated by infinitely iterated morphismsGeneralized Morse sequences







This page was built for publication: Unending chess, symbolic dynamics and a problem in semi-groups