The equation \(a_ M=b^ Nc^ P\) in a free group
From MaRDI portal
Publication:775458
DOI10.1307/mmj/1028998766zbMath0106.02204OpenAlexW1523480252MaRDI QIDQ775458
Roger C. Lyndon, Schützenberger, Marcel-Paul
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
Related Items
Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes), Structural properties of the string statistics problem, On a conjecture on bidimensional words., An optimal algorithm to compute all the covers of a string, On del-robust primitive words, Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups., On some equations in free partially commutative monoids, Word-paired catenations of regular languages, Vertex and edge orbits of Fibonacci and Lucas cubes, The problems of cyclic equality and conjugacy for finite complete rewriting systems, Transducers and the decidability of independence in free monoids, Strong surjections from two-complexes with trivial top-cohomology onto the torus, Decidability and independence of conjugacy problems in finitely presented monoids, On purely loxodromic actions, Slender 0L languages, On the language of primitive words, Representations of language families by homomorphic equality operations and generalized equality sets, Finding all periods and initial palindromes of a string in parallel, On deciding the confluence of a finite string-rewriting system on a given congruence class, Disjunctive splittability of languages, Closure properties of pattern languages, Alternative proof of the Lyndon-Schützenberger theorem, Periodicity in rectangular arrays, Saving comparisons in the Crochemore-Perrin string-matching algorithm, Fixed points of Sturmian morphisms and their derivated words, Scott complexity and adjoining roots to finitely generated groups., Counting with rational functions, Data structures and algorithms for the string statistics problem, The origins of combinatorics on words, Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems, Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup, Free submonoids in the monoid of languages, The single loop representations of regular languages, A relation by palindromic subwords, A note on prefix primitive words, Completing comma-free codes, On periodic properties of circular words, Almost congruence extension property for subgroups of free groups, On block pumpable languages, Multiple equality sets and Post machines, Synchronizing delay for binary uniform morphisms, Periods in strings, Relationship between the period of a finite word and the length of its unbordered segments, On some combinatorial problems in free monoids, Optimal off-line detection of repetitions in a string, Some kinds of primitive and non-primitive words, The dynatomic periodic curves for polynomial \(z\mapsto z^d+c\) are smooth and irreducible, Nondeterministic automatic complexity of overlap-free and almost square-free words, Parallel detection of all palindromes in a string, Fast parallel string prefix-matching, \(\mathbb Z_n\)-manifolds in 4-dimensional graph-manifolds, Periodicity and repetitions in parameterized strings, Generalized pattern matching and periodicity under substring consistent equivalence relations, Optimal parallel detection of squares in strings, Efficient detection of quasiperiodicities in strings, Efficient CRCW-PRAM algorithms for universal substring searching, On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup, On monoids presented by a single relation, Three-element codes with one \(d\)-primitive word, A note on pure codes, Borderedness-preserving homomorphisms, Equations quadratiques dans le groupe libre, Prefix-primitive annihilators of languages under some operations, An extension of the Lyndon-Schützenberger result to pseudoperiodic words, Every subsemigroup of a free semigroup with zero is not an R-semigroup, More on the archimedean relation on the free semigroup, A note on a problem of \textit{Hua}, Every real number greater than 1 is a critical exponent, Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles, The extended equation of Lyndon and Schützenberger, Detecting conjugacy stability of subgroups in certain classes of groups, Regular autodense languages, Periodes et repetitions des mots du monoide libre, On decidability of theories of regular languages, Wheeler languages, The disjunctivities of \(\omega\)-languages., Twin-roots of words and their properties, Periodicity and unbordered segments of words, On certain elements of free groups, Commutativity in free inverse monoids, Some properties of the disjunctive languages contained in \(Q\), On the Shyr-Yu theorem, Detecting palindromes, patterns and borders in regular languages, Hamming distance for conjugates, Uniformly growing k-th power-free homomorphisms, Time-space-optimal string matching, A characterization of local regular languages, On F-semigroups with three generators, Strategies to annihilate coincidences of maps from two-complexes into the circle, A combinatorial property of the factor poset of a word, On balanced sequences and their critical exponent, Palindrome complexity., On Fine and Wilf's theorem for bidimensional words., Homogeneous Thue systems and the Church-Rosser property, Binary codes that do not preserve primitivity, Unambiguous injective morphisms in free groups, Monogenic \(e\)-closed languages and dipolar words, Optimal superprimitivity testing for strings, Complexity results on the conjugacy problem for monoids, Quasivarieties of \(\ell\)-groups and groups, Idempotent varieties of incidence monoids and bipartite posets, Unnamed Item, Watson-Crick powers of a word, String rearrangement inequalities and a total order between primitive words, An Inequality for the Number of Periods in a Word, String Matching: Communication, Circuits, and Learning., Optimal parallel suffix tree construction, Post-plus languages, Codes and equations on trees, Binary codes that do not preserve primitivity, Powers as products of commutators, Equations enforcing repetitions under permutations, Recurrence and periodicity in infinite words from local periods, Watson-Crick palindromes in DNA computing, Generalized Lyndon factorizations of infinite words, Palindrome words and reverse closed languages, ON RANK, ROOT AND EQUATIONS IN FREE GROUPS, PCP-prime words and primality types, Automatic sequences of rank two, On rationally controlled one-rule insertion systems, The word problem for one-relator semigroups, Equations in the Partial Semigroup of Words with Overlapping Products, Linear groups with Borel's property, On the distribution of characteristic parameters of words, Words that almost commute, On Lyndon's equation in some Λ-free groups and HNN extensions, On primitive words with non-primitive product, Residual nilpotence and relations in free groups, Unnamed Item, A note on thue systems with a single defining relation, Residual nilpotence and relations in free groups, Finite Completion of comma-free codes Part 2, A note of ins-primitive words, Generalizations of free groups: some questions, Unnamed Item, Coincidence of maps from connected sums of closed surfaces into graphs, Primitive sets of words, One-Variable Equations in Free Groups, A note on free subsemigroups with two generators, Counting (Watson-Crick) palindromes in Watson-Crick conjugates, Insertion and deletion of words: Determinism and reversibility, Reprint of: ``Generalized Lyndon factorizations of infinite words, Onn-power prefix languages, Word equations with \(k\)th powers of variables, Efficient string matching on packed texts, Avoidance of split overlaps, Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time, Duplication in DNA Sequences, Finite Automata, Palindromes, Powers, and Patterns, Borders, palindrome prefixes, and square prefixes, A note of prefix n-primitive words, Languages and P0L schemes, Equations on partial words, On Critical exponents in fixed points ofk-uniform binary morphisms, Some properties of related involution palindrome words, A note of involutively bordered words, Non-primitive words of the formpqm, A note of solutions to the morphic involution language equations, Elementary equivalence vs. commensurability for hyperbolic groups, Post correspondence problem: Words possible as primitive solutions, Prefix-primitivity-preserving homomorphisms, Combinatorics of Polymer-Based Models of Early Metabolism, Block reversal on finite words, The disjunctivity of primitive languages, Some property-preserving homomorphisms, Local languages, Disjunctive languages and compatible orders, Unnamed Item, Real-time recognition of substring repetition and reversal, Codes et motifs, Two-Dimensional Palindromes and Their Properties, Experimenting with Infinite Groups, I, Primitive partial words, Some remarks about stabilizers, Prefix Primitive Languages, Properties of pure codes, The equation $x^py^q=z^r$ and groups that act freely on $Łambda $-trees, Binary equality words with two $b$'s, On balanced presentations of the trivial group., Classifications of dense languages, Overlapping words, codes, disjunctivity and density of languages, The Shuffle Product: New Research Directions, Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words, Some properties of involution palindrome languages, Optimal parallel algorithms for periods, palindromes and squares, Groups and Embeddings inSL(2, ℂ), Counting Parameterized Border Arrays for a Binary Alphabet, Annihilators of bifix codes, A brief history of parameterized matching problems, δ-codes and δ-languages, Pseudo-solutions of word equations, Recursively enumerable degress and the conjugacy problem, On some groups with a single defining realtor, A characterization of prefix n-power words, Closures in Formal Languages and Kuratowski’s Theorem, An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words, Powers of Regular Languages, The problem of freedom on certain subsemigroups of the submonoid of left singular languages, Word-paired insertions of languages, Two classes of languages related to the prefix codes, Periodic unique beta-expansions: the Sharkovskiĭ ordering, Solutions to the involution language equation, Equations in groups, On the finiteness of the classifying space for the family of virtually cyclic subgroups, Non-∀-homogeneity in free groups, A note on special thue systems with a single defining relation, Non-singular graph-manifolds of dimension 4, Dependences related to strict binary relations, On the simplest centralizer of a language, Boolean algebras of regular languages, On univoque Pisot numbers, A multidimensional critical factorization theorem, Periodicity and Repetitions in Parameterized Strings, On a topology defined by primitive words, The transitivity of primary conjugacy in regular \(\omega\)-semigroups
