Automaton semigroup constructions.

DOI10.1007/S00233-014-9632-XzbMATH Open1336.20062arXiv1310.4852OpenAlexW3100372386MaRDI QIDQ744860FDOQ744860

Authors: Tara Brough, Alan J. Cain 

Publication date: 12 October 2015

Published in: Semigroup Forum (Search for Journal in Brave)

Abstract: The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton semigroup. We also show that the class of automaton semigroups is closed under the combined operation of 'free product followed by adjoining an identity'. We present an example of a free product of finite semigroups that we conjecture is not an automaton semigroup. Turning to wreath products, we consider two slight generalizations of the concept of an automaton semigroup, and show that a wreath product of an automaton monoid and a finite monoid arises as a generalized automaton semigroup in both senses. We also suggest a potential counterexample that would show that a wreath product of an automaton monoid and a finite monoid is not a necessarily an automaton monoid in the usual sense.

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

Recommendations

• Automaton semigroups
• scientific article; zbMATH DE number 3225362
• Self-automaton semigroups.
• Automatic structures for semigroup constructions.
• CAYLEY AUTOMATON SEMIGROUPS
• scientific article; zbMATH DE number 3225363
• Computing automorphisms of semigroups.
• Automatic semigroups
• Automata groups.
• Automatic semigroups producing an automaton semigroup

zbMATH Keywords

free productswreath productsfinite semigroupsautomaton semigroupssemigroup constructions

Mathematics Subject Classification ID

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

Cites Work

• On the Burnside problem for periodic groups
• On Burnside's problem on periodic groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Title not available (Why is that?)
• Automaton semigroups
• Automata, dynamical systems, and groups
• Automata over a binary alphabet generating free groups of even rank.
• CAYLEY AUTOMATON SEMIGROUPS
• ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
• The finiteness problem for automaton semigroups is undecidable.
• Self-similarity and branching in group theory.

Cited In (16)

• Title not available (Why is that?)
• On the structure theory of partial automaton semigroups
• On the complexity of the word problem for automaton semigroups and automaton groups
• Automatic semigroups vs automaton semigroups
• Amalgamated free product in terms of automata constructions
• Title not available (Why is that?)
• Automatic semigroups producing an automaton semigroup
• An automaton group with undecidable order and Engel problems
• Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
• Automaton semigroups
• Computing automorphisms of semigroups.
• Automaton (semi)groups: Wang tilings and Schreier tries
• Automatic presentations and semigroup constructions
• On the orbits of automaton semigroups and groups
• Automatic structures for semigroup constructions.
• Automaton semigroups: new constructions results and examples of non-automaton semigroups

This page was built for publication: Automaton semigroup constructions.

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