Automatic structures for semigroup constructions.

DOI10.1007/S00233-007-9026-4MaRDI QIDQ2481327zbMATHOpenAlexFDO

Authors Yanyan Li

Publication date 9 April 2008

Published in Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

direct productsfree productswreath productsBruck-Reilly extensionsautomatic semigroups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.

Recommendations

• Automatic subsemigroups of free products.
• Automatic presentations and semigroup constructions
• Automatic semigroups and Bruck-Reilly extensions.
• scientific article; zbMATH DE number 1529076
• Automaton semigroup constructions.

Cites work

• scientific article; zbMATH DE number 3132783 (Why is no real title available?)
• scientific article; zbMATH DE number 1189057 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 1530302 (Why is no real title available?)
• scientific article; zbMATH DE number 1529076 (Why is no real title available?)
• scientific article; zbMATH DE number 1750601 (Why is no real title available?)
• scientific article; zbMATH DE number 1405695 (Why is no real title available?)
• A Geometric Characterization of Automatic Monoids
• AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
• Automatic completely-simple semigroups
• Automatic design error correction of combinatorial circuits
• Automatic groups and amalgams
• Automatic monoids and change of generators
• Automatic semigroups
• Automaticity and commutative semigroups
• Bisimple ω-Semigroups
• Finite generation and presentability of wreath products of monoids.
• Finite presentability of Bruck-Reilly extensions of groups
• Generators and relations of direct products of semigroups
• ON FINITE GENERATION AND OTHER FINITENESS CONDITIONS FOR WREATH PRODUCTS OF SEMIGROUPS
• On diagonal acts of monoids
• On simple inverse semigroups
• SUBSEMIGROUPS OF THE BICYCLIC MONOID

Cited in

(13)

• Automatic semigroups and Bruck-Reilly extensions.
• Semiautomatic structures
• Semiautomatic structures
• Automatic Presentations for Cancellative Semigroups
• Automatic structure for generalized Bruck-Reilly \(*\)-extension of a monoid
• Automaton semigroup constructions.
• Automatic semigroup acts.
• Automatic Rees matrix semigroups over categories.
• Automatic completely-simple semigroups
• Automatic presentations and semigroup constructions
• FINITE PRESENTABILITY OF SEMIGROUP CONSTRUCTIONS
• Quasi-automatic semigroups
• scientific article; zbMATH DE number 1529076 (Why is no real title available?)

This page was built for publication: Automatic structures for semigroup constructions.

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