Generic complexity of the word problem in some semigroups

DOI10.1007/s10469-023-09717-yOpenAlexW4388697737MaRDI QIDQ6148012

Alexander N. Rybalov

Publication date: 11 January 2024

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-023-09717-y

zbMATH Keywords

word problemfinitely generated semigroupgeneric decidability

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites Work

• Generic-case complexity, decision problems in group theory, and random walks.
• Counting paths in graphs
• The word problem for one-relation monoids: a survey
• Some Questions in Computable Mathematics
• Generic complexity of undecidable problems
• Recursive Unsolvability of a problem of Thue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic complexity of the word problem in some semigroups