Automaton semigroup constructions.

DOI10.1007/S00233-014-9632-XzbMath1336.20062arXiv1310.4852OpenAlexW3100372386MaRDI QIDQ744860

Alan J. Cain, Tara Brough

Publication date: 12 October 2015

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

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

zbMATH Keywords

wreath productsfree 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)

Related Items (9)

On the complexity of the word problem for automaton semigroups and automaton groups ⋮ Amalgamated free product in terms of automata constructions ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ An automaton group with undecidable order and Engel problems ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Automaton semigroups: new constructions results and examples of non-automaton semigroups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the structure theory of partial automaton semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automaton semigroups
• On the Burnside problem for periodic groups
• On Burnside's problem on periodic groups
• Implementing Computations in Automaton (Semi)groups
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• CAYLEY AUTOMATON SEMIGROUPS
• ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE

This page was built for publication: Automaton semigroup constructions.