Algorithmic recognition of identities in one class of finitely presented semigroups

DOI10.1007/BF01164275zbMATH Open0717.20042OpenAlexW1995693099MaRDI QIDQ753963FDOQ753963

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

relationswordsgeneratorsfinitely presented semigroupsalgorithmically unsolvablecorepresentation graphsfree subsemigroupunrecognizable identity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• The construction of a recognition algorithm in the algebraic closure.
• Title not available (Why is that?)
• 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)