Pages that link to "Item:Q1391138"
From MaRDI portal
The following pages link to A note on decidability questions on presentations of word semigroups (Q1391138):
Displaying 23 items.
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- The minimum substring cover problem (Q958306) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- Generalized factorizations of words and their algorithmic properties (Q1292486) (← links)
- Partial words and a theorem of Fine and Wilf (Q1292487) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- A note on decidability questions on presentations of word semigroups (Q1391138) (← links)
- The homomorphism problem for trace monoids. (Q1426045) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- Context-free languages of sub-exponential growth (Q1608320) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- On subsemigroups of finitely presented semigroups (Q1911631) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- On finitely generated submonoids of virtually free groups (Q2317164) (← links)
- Computing by commuting. (Q2490820) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- Free subsemigroups in topological semigroups (Q2655462) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations (Q3392943) (← links)
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS (Q4513303) (← links)
- Reachability via Cooperating Morphisms (Q4982083) (← links)
- Inverse Subsemigroups of the Monogenic Free Inverse Semigroup (Q5478640) (← links)
