The equation a_ M=b^ Nc^ P in a free group
From MaRDI portal
Publication:775458
DOI10.1307/MMJ/1028998766zbMATH Open0106.02204OpenAlexW1523480252MaRDI QIDQ775458FDOQ775458
Authors: Roger C. Lyndon, Marcel Paul Schützenberger
Publication date: 1962
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1028998766
Cited In (only showing first 100 items - show all)
- Equations quadratiques dans le groupe libre
- Homogeneous Thue systems and the Church-Rosser property
- On the simplest centralizer of a language
- A multidimensional critical factorization theorem
- Equations in groups
- A note on a problem of \textit{Hua}
- On univoque Pisot numbers
- Representations of language families by homomorphic equality operations and generalized equality sets
- Powers as products of commutators
- On certain elements of free groups
- Properties of pure codes
- Disjunctive splittability of languages
- Optimal parallel detection of squares in strings
- A characterization of local regular languages
- A combinatorial property of the factor poset of a word
- Finite Completion of comma-free codes Part 2
- A note on pure codes
- Three-element codes with one \(d\)-primitive word
- Recurrence and periodicity in infinite words from local periods
- Counting with rational functions
- Twin-roots of words and their properties
- Prefix-primitive annihilators of languages under some operations
- On some combinatorial problems in free monoids
- Non-singular graph-manifolds of dimension 4
- Block reversal on finite words
- Regular autodense languages
- Transducers and the decidability of independence in free monoids
- The disjunctivities of \(\omega\)-languages.
- Every subsemigroup of a free semigroup with zero is not an R-semigroup
- Monogenic \(e\)-closed languages and dipolar words
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup
- The extended equation of Lyndon and Schützenberger
- Quasivarieties of \(\ell\)-groups and groups
- Classifications of dense languages
- On F-semigroups with three generators
- On periodic properties of circular words
- On block pumpable languages
- A note on special thue systems with a single defining relation
- Synchronizing delay for binary uniform morphisms
- Residual nilpotence and relations in free groups
- A note on thue systems with a single defining relation
- On the Shyr-Yu theorem
- Hamming distance for conjugates
- Disjunctive languages and compatible orders
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
- Idempotent varieties of incidence monoids and bipartite posets
- On a topology defined by primitive words
- Annihilators of bifix codes
- δ-codes and δ-languages
- Non-∀-homogeneity in free groups
- Optimal parallel algorithms for periods, palindromes and squares
- Finite Automata, Palindromes, Powers, and Patterns
- The Shuffle Product: New Research Directions
- On monoids presented by a single relation
- Title not available (Why is that?)
- \(\mathbb Z_n\)-manifolds in 4-dimensional graph-manifolds
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
- Periodes et repetitions des mots du monoide libre
- Periods in strings
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Efficient detection of quasiperiodicities in strings
- Periodicity and unbordered segments of words
- Watson-Crick palindromes in DNA computing
- On the distribution of characteristic parameters of words
- Alternative proof of the Lyndon-Schützenberger theorem
- Onn-power prefix languages
- On primitive words with non-primitive product
- Parallel detection of all palindromes in a string
- Slender 0L languages
- Relationship between the period of a finite word and the length of its unbordered segments
- Periodic unique beta-expansions: the Sharkovskiĭ ordering
- Every real number greater than 1 is a critical exponent
- On del-robust primitive words
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Palindrome words and reverse closed languages
- Residual nilpotence and relations in free groups
- Dependences related to strict binary relations
- String rearrangement inequalities and a total order between primitive words
- Recursively enumerable degress and the conjugacy problem
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Title not available (Why is that?)
- Prefix Primitive Languages
- One-Variable Equations in Free Groups
- Vertex and edge orbits of Fibonacci and Lucas cubes
- On the finiteness of the classifying space for the family of virtually cyclic subgroups
- On a conjecture on bidimensional words.
- On some equations in free partially commutative monoids
- Strong surjections from two-complexes with trivial top-cohomology onto the torus
- On Critical exponents in fixed points ofk-uniform binary morphisms
- Palindrome complexity.
- A note of ins-primitive words
- A relation by palindromic subwords
- On purely loxodromic actions
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- Duplication in DNA Sequences
- Optimal off-line detection of repetitions in a string
- Data structures and algorithms for the string statistics problem
- A note of prefix n-primitive words
- The origins of combinatorics on words
- Multiple equality sets and Post machines
This page was built for publication: The equation \(a_ M=b^ Nc^ P\) in a free group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775458)