INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS

DOI10.1142/S0218196710005960zbMath1242.20069MaRDI QIDQ3069782

Janusz Konrad Slupik, A. S. Olijnyk, V. I. Sushchans'kyi

Publication date: 19 January 2011

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

conjugacyautomatawreath productsClifford semigroupsmonogenic inverse semigroupslevel transitivitypartial automorphisms of rooted trees

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18) Representation of semigroups; actions of semigroups on sets (20M30)

Related Items (3)

On the complexity of the word problem for automaton semigroups and automaton groups ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ On the structure theory of partial automaton semigroups

Cites Work

• Unnamed Item
• On the 3-state Mealy automata over an \(m\)-symbol alphabet of growth order \([n^{\log n/2\log m}\).]
• Classical finite transformation semigroups. An introduction.
• Automaton semigroups
• The smallest Mealy automaton of intermediate growth.
• CAYLEY AUTOMATON SEMIGROUPS
• MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
• CONJUGATION IN TREE AUTOMORPHISM GROUPS

This page was built for publication: INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS