Unitary monoid with two generators: An algorithmic point of view
From MaRDI portal
Recommendations
- A string-matching interpretation of the equation x^ m y^ n = z^ p
- Algorithmic ways of deciding whether an infinite language is a code
- scientific article; zbMATH DE number 2143015
- Efficient solution of some problems in free partially commutative monoids
- A note on the free submonoids of the monoid of prefix codes
Cited in
(2)
This page was built for publication: Unitary monoid with two generators: An algorithmic point of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027623)