A note on automatic semigroups.

DOI10.1007/S00233-012-9446-7MaRDI QIDQ1955595zbMATH OpenOpenAlexFDO

Authors E. R. Dombi

Publication date 14 June 2013

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00233-012-9446-7

zbMATH Keywords

automatic semigroupsfinite generating setsfinitely generated semigroupsmonoidsregular languagesregular semigroups

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Free semigroups, generators and relations, word problems (20M05) Regular semigroups (20M17) Semigroups in automata theory, linguistics, etc. (20M35)

Review text

Let \(S\) be a semigroup generated by a finite set \(A\) and \(L\) a regular language over \(A\). The pair \((A,L)\) is said to be an automatic structure for \(S\) if some conditions are fulfilled. If a semigroup \(S\) has an automatic structure then \(S\) is called automatic. It is known that this property does not depend on the choice of the semigroup generating set for monoids and completely simple semigroups. The author extends these results. The main theorem says that if a semigroup \(S\) satisfies the equality \(SS=S\) then if \(S\) is automatic with respect to a finite generating set then it is automatic with respect to any other finite generating set. Thus, for instance, regular semigroups have the same property.

Recommendations

• An automatic semigroup of languages
• The problem on automaticity of semigroups of regular languages.
• Automatic subsemigroups of free products.
• Automatic semigroups
• Automatic completely-simple semigroups

Cites work

• A Geometric Characterization of Automatic Monoids
• Automatic completely-simple semigroups
• Automatic monoids and change of generators
• Automatic semigroups
• Automatic semigroups and Bruck-Reilly extensions.
• Automatic semigroups and categories.
• Automatic structures for subsemigroups of Baumslag-Solitar semigroups.
• Automaticity and commutative semigroups
• Extensions and submonoids of automatic monoids.
• Generators and relations of direct products of semigroups
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 1958322 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1750601 (Why is no real title available?)
• Notions of automaticity in semigroups.

Cited in

(23)

• Notions of automaticity in semigroups.
• A semigroup approach to automaticity
• Automatic completely-simple semigroups
• Automatic semigroup acts.
• An automatic semigroup of languages
• Automatic Rees matrix semigroups over categories.
• Automatic structures for subsemigroups of Baumslag-Solitar semigroups.
• Semigroups over which no automaton has proper essential congruences
• Automaticity of a Clifford semigroup
• On the structure of finitely generated semigroups of unary regular languages
• CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
• Automatic Presentations for Cancellative Semigroups
• The problem on automaticity of semigroups of regular languages.
• scientific article; zbMATH DE number 1529076 (Why is no real title available?)
• Automaticity and commutative semigroups
• scientific article; zbMATH DE number 1370347 (Why is no real title available?)
• scientific article; zbMATH DE number 1857725 (Why is no real title available?)
• Automatic monoids and change of generators
• Quasi-automatic semigroups
• Semi-groupes fortement automatiques.
• A note on finitely generated semigroups of regular languages.
• Fundamentals of Computation Theory
• A geometric characterization of automatic semigroups

This page was built for publication: A note on automatic semigroups.

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