The loop problem for Rees matrix semigroups.

DOI10.1007/S00233-007-9016-6MaRDI QIDQ2481325zbMATHOpenAlexFDO

Authors Mark Kambites

Publication date 9 April 2008

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0702691

zbMATH Keywords

Cayley graphsfinitely generated semigroupsRees matrix semigroupscompletely zero-simple semigroupsloop problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: We study the relationship between the loop problem of a semigroup, and that of a Rees matrix construction (with or without zero) over the semigroup. This allows us to characterize exactly those completely zero-simple semigroups for which the loop problem is context-free. We also establish some results concerning loop problems for subsemigroups and Rees quotients.

Recommendations

• The loop problem for monoids and semigroups
• Automatic completely-simple semigroups
• scientific article; zbMATH DE number 1750601
• Rees matrix semigroups
• On finiteness conditions for Rees matrix semigroups

Cites work

• scientific article; zbMATH DE number 1604229 (Why is no real title available?)
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 1283959 (Why is no real title available?)
• scientific article; zbMATH DE number 1750601 (Why is no real title available?)
• scientific article; zbMATH DE number 774017 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• ALGORITHMIC PROBLEMS IN VARIETIES
• An algebraic characterization of groups with soluble word problem
• Automatic semigroups and categories.
• Embedding semigroups into idempotent generated ones.
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
• Generators and relations of Rees matrix semigroups
• Groups, the theory of ends, and context-free languages
• Higman's embedding theorem in a general setting and its application to existentially closed algebras
• ON GROUPS AND COUNTER AUTOMATA
• On a subclass of context-free groups
• PRESENTATIONS FOR SEMIGROUPS AND SEMIGROUPOIDS
• Rees Matrix Covers for Locally Inverse Semigroups
• Simple projecting maps
• The accessibility of finitely presented groups
• The loop problem for monoids and semigroups
• Word problems recognisable by deterministic blind monoid automata

Cited in

(5)

• Rees matrix constructions for clustering of data.
• Right regular triples of semigroups
• The loop problem for monoids and semigroups
• Researches of semigroups with planar Cayley graphs: results and problems
• On special Rees matrix semigroups over semigroups

This page was built for publication: The loop problem for Rees matrix semigroups.

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