Generic complexity of the word problem in some semigroups
From MaRDI portal
Recommendations
- Generic complexity of finitely presented monoids and semigroups
- Complexity of the word problem for commutative semigroups of fixed dimension
- Generic complexity of the membership problem for semigroups of integer matrices
- scientific article; zbMATH DE number 1535398
- Residual finiteness of a class of semigroups presented by a single relation
Cites work
- Counting paths in graphs
- Generic complexity of undecidable problems
- Generic-case complexity, decision problems in group theory, and random walks.
- scientific article; zbMATH DE number 3142911 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3746135 (Why is no real title available?)
- scientific article; zbMATH DE number 1535398 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- scientific article; zbMATH DE number 3302312 (Why is no real title available?)
- scientific article; zbMATH DE number 3307572 (Why is no real title available?)
- Recursive unsolvability of a problem of Thue
- Some Questions in Computable Mathematics
- The word problem for one-relation monoids: a survey
This page was built for publication: Generic complexity of the word problem in some semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148012)