Automaton semigroups: new constructions results and examples of non-automaton semigroups

DOI10.1016/j.tcs.2017.02.003zbMath1381.20052arXiv1601.01168OpenAlexW2962733472MaRDI QIDQ528468

Tara Brough, Alan J. Cain

Publication date: 12 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

constructionswreath productfree productsmall extensionsautomaton semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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 ⋮ To Infinity and Beyond ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the structure theory of partial automaton semigroups

Cites Work

• Automaton semigroup constructions.
• Numerical semigroups.
• Automaton semigroups
• On Burnside's problem on periodic groups
• Implementing Computations in Automaton (Semi)groups
• The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• CAYLEY AUTOMATON SEMIGROUPS
• Structure Results for Transitive, Untwisted, Superlinked Finite Covers
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automaton semigroups: new constructions results and examples of non-automaton semigroups