Pages that link to "Item:Q775458"
From MaRDI portal
The following pages link to The equation \(a_ M=b^ Nc^ P\) in a free group (Q775458):
Displaying 50 items.
- Periods in strings (Q1154284) (← links)
- Relationship between the period of a finite word and the length of its unbordered segments (Q1159466) (← links)
- On some combinatorial problems in free monoids (Q1160130) (← links)
- Optimal off-line detection of repetitions in a string (Q1170893) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- On monoids presented by a single relation (Q1218040) (← links)
- Equations quadratiques dans le groupe libre (Q1227064) (← links)
- Every subsemigroup of a free semigroup with zero is not an R-semigroup (Q1231008) (← links)
- More on the archimedean relation on the free semigroup (Q1236624) (← links)
- A note on a problem of \textit{Hua} (Q1239272) (← links)
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles (Q1246508) (← links)
- Periodes et repetitions des mots du monoide libre (Q1255785) (← links)
- On certain elements of free groups (Q1270956) (← links)
- Commutativity in free inverse monoids (Q1275459) (← links)
- Monogenic \(e\)-closed languages and dipolar words (Q1318822) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Slender 0L languages (Q1351458) (← links)
- On the language of primitive words (Q1351946) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- Free submonoids in the monoid of languages (Q1381858) (← links)
- The single loop representations of regular languages (Q1383380) (← links)
- Completing comma-free codes (Q1399997) (← links)
- A characterization of local regular languages (Q1584215) (← links)
- Decidability and independence of conjugacy problems in finitely presented monoids (Q1637219) (← links)
- Fixed points of Sturmian morphisms and their derivated words (Q1659979) (← links)
- Almost congruence extension property for subgroups of free groups (Q1693073) (← links)
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup (Q1763704) (← links)
- The disjunctivities of \(\omega\)-languages. (Q1811081) (← links)
- Uniformly growing k-th power-free homomorphisms (Q1838047) (← links)
- Time-space-optimal string matching (Q1838329) (← links)
- On F-semigroups with three generators (Q1844313) (← links)
- A combinatorial property of the factor poset of a word (Q1847375) (← links)
- Palindrome complexity. (Q1853729) (← links)
- On Fine and Wilf's theorem for bidimensional words. (Q1853743) (← links)
- On a conjecture on bidimensional words. (Q1874389) (← links)
- Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups. (Q1880639) (← links)
- Word-paired catenations of regular languages (Q1886339) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Data structures and algorithms for the string statistics problem (Q1913702) (← links)
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup (Q1921846) (← links)
- Borderedness-preserving homomorphisms (Q2015145) (← links)
- Detecting conjugacy stability of subgroups in certain classes of groups (Q2037525) (← links)
- On decidability of theories of regular languages (Q2043872) (← links)
- Wheeler languages (Q2051845) (← links)
- Strategies to annihilate coincidences of maps from two-complexes into the circle (Q2090633) (← links)
- On balanced sequences and their critical exponent (Q2098168) (← links)
- Binary codes that do not preserve primitivity (Q2104527) (← links)
- Unambiguous injective morphisms in free groups (Q2105430) (← links)
