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)
- 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
- Some remarks about stabilizers
- Uniformly growing k-th power-free homomorphisms
- Some kinds of primitive and non-primitive words
- A characterization of prefix n-power words
- Optimal superprimitivity testing for strings
- A note on prefix primitive words
- Some properties of involution palindrome languages
- A note of involutively bordered words
- Finding all periods and initial palindromes of a string in parallel
- The dynatomic periodic curves for polynomial \(z\mapsto z^d+c\) are smooth and irreducible
- Completing comma-free codes
- Some properties of the disjunctive languages contained in \(Q\)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- Time-space-optimal string matching
- Closure properties of pattern languages
- Periodicity in rectangular arrays
- An optimal algorithm to compute all the covers of a string
- Detecting palindromes, patterns and borders in regular languages
- Powers of Regular Languages
- Codes and equations on trees
- Primitive partial words
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- On Lyndon's equation in some Λ-free groups and HNN extensions
- Counting Parameterized Border Arrays for a Binary Alphabet
- Nondeterministic automatic complexity of overlap-free and almost square-free words
- Free submonoids in the monoid of languages
- Scott complexity and adjoining roots to finitely generated groups.
- Real-time recognition of substring repetition and reversal
- Complexity results on the conjugacy problem for monoids
- Structural properties of the string statistics problem
- Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.
- The problems of cyclic equality and conjugacy for finite complete rewriting systems
- The equation $x^py^q=z^r$ and groups that act freely on $Łambda $-trees
- Boolean algebras of regular languages
- Equations on partial words
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Decidability and independence of conjugacy problems in finitely presented monoids
- Codes et motifs
- Fast parallel string prefix-matching
- Efficient string matching on packed texts
- Periodicity and repetitions in parameterized strings
- Primitive sets of words
- On Fine and Wilf's theorem for bidimensional words.
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
- The word problem for one-relator semigroups
- 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
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)
