Algorithmic recognition of identities in one class of finitely presented semigroups

DOI10.1007/BF01164275MaRDI QIDQ753963zbMATH OpenOpenAlexFDO

Authors Shneerson, L. M.

Publication date 1990

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01164275

zbMATH Keywords

algorithmically unsolvablecorepresentation graphsfinitely presented semigroupsfree subsemigroupgeneratorsrelationsunrecognizable identitywords

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Free semigroups, generators and relations, word problems (20M05)

Review text

See the review in Zbl 0709.20036.

Cited in

(4)

• The construction of a recognition algorithm in the algebraic closure.
• scientific article; zbMATH DE number 59506 (Why is no real title available?)
• On the identifiability of binary Segre products
• Distinguishability of a Semi-Group by a Machine

This page was built for publication: Algorithmic recognition of identities in one class of finitely presented semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753963)