The equation a_ M=b^ Nc^ P in a free group
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Regular autodense languages
- Twin-roots of words and their properties
- On the Shyr-Yu theorem
- Detecting palindromes, patterns and borders in regular languages
- Hamming distance for conjugates
- Complexity results on the conjugacy problem for monoids
- Quasivarieties of \(\ell\)-groups and groups
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
- Structural properties of the string statistics problem
- On some equations in free partially commutative monoids
- The problems of cyclic equality and conjugacy for finite complete rewriting systems
- Representations of language families by homomorphic equality operations and generalized equality sets
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- Disjunctive splittability of languages
- Counting with rational functions
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
- Multiple equality sets and Post machines
- 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
- Optimal parallel detection of squares in strings
- Efficient CRCW-PRAM algorithms for universal substring searching
- On monoids presented by a single relation
- Equations quadratiques dans le groupe libre
- 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}
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Periodes et repetitions des mots du monoide libre
- On certain elements of free groups
- Commutativity in free inverse monoids
- Monogenic e-closed languages and dipolar words
- An optimal algorithm to compute all the covers of a string
- Transducers and the decidability of independence in free monoids
- Slender 0L languages
- On the language of primitive words
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Free submonoids in the monoid of languages
- The single loop representations of regular languages
- Completing comma-free codes
- A characterization of local regular languages
- Decidability and independence of conjugacy problems in finitely presented monoids
- Fixed points of Sturmian morphisms and their derivated words
- Almost congruence extension property for subgroups of free groups
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup
- The disjunctivities of -languages.
- Uniformly growing k-th power-free homomorphisms
- Time-space-optimal string matching
- On F-semigroups with three generators
- A combinatorial property of the factor poset of a word
- Palindrome complexity.
- On Fine and Wilf's theorem for bidimensional words.
- On a conjecture on bidimensional words.
- Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.
- Word-paired catenations of regular languages
- Finding all periods and initial palindromes of a string in parallel
- Data structures and algorithms for the string statistics problem
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
- Borderedness-preserving homomorphisms
- Detecting conjugacy stability of subgroups in certain classes of groups
- On decidability of theories of regular languages
- Wheeler languages
- Strategies to annihilate coincidences of maps from two-complexes into the circle
- On balanced sequences and their critical exponent
- Binary codes that do not preserve primitivity
- Unambiguous injective morphisms in free groups
- On a topology defined by primitive words
- The transitivity of primary conjugacy in regular \(\omega\)-semigroups
- Words that almost commute
- Reprint of: ``Generalized Lyndon factorizations of infinite words
- Avoidance of split overlaps
- Borders, palindrome prefixes, and square prefixes
- Block reversal on finite words
- Some remarks about stabilizers
- A brief history of parameterized matching problems
- Pseudo-solutions of word equations
- On the finiteness of the classifying space for the family of virtually cyclic subgroups
- Boolean algebras of regular languages
- Residual nilpotence and relations in free groups
- Word equations with \(k\)th powers of variables
- Prefix-primitivity-preserving homomorphisms
- Primitive partial words
- On balanced presentations of the trivial group.
- Classifications of dense languages
- Recursively enumerable degress and the conjugacy problem
- On some groups with a single defining realtor
- Non-singular graph-manifolds of dimension 4
- Dependences related to strict binary relations
- A multidimensional critical factorization theorem
- Linear groups with Borel's property
- Coincidence of maps from connected sums of closed surfaces into graphs
- Primitive sets of words
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates
- On del-robust primitive words
- The Shuffle Product: New Research Directions
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
- Groups and embeddings in \(\mathrm{SL}(2,\mathbb{C})\)
- Vertex and edge orbits of Fibonacci and Lucas cubes
- Some properties of related involution palindrome words
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)
