Minimal generating sets in groups of p-automata

DOI10.15330/CMP.15.2.608-613MaRDI QIDQ6187202zbMATH OpenOpenAlexFDO

Authors Ya. V. Lavrenyuk, A. Oliynyk

Publication date 31 January 2024

Published in Carpathian Mathematical Publications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.15330/cmp.15.2.608-613

zbMATH Keywords

\(p\)-automatonfinite automatonminimal generating set

Mathematics Subject Classification ID

Groups acting on trees (20E08) Extensions, wreath products, and other compositions of groups (20E22) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet
• Free groups defined by finite $p$-automata
• The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set.
• On finite and Abelian groups generated by finite automata.
• Automorphisms of a minimal nonabelian p-group with p odd. I.

Cites work

• Automata, dynamical systems, and groups
• Finite state wreath powers of transformation semigroups.
• Free groups defined by finite $p$-automata
• Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet
• On exponentiation, p-automata and HNN extensions of free abelian groups
• On finite state automaton actions of HNN extensions of free abelian groups
• Self-similar groups, automatic sequences, and unitriangular representations
• The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set.

Cited in

(1)

• Free products of groups defined by p-automata

This page was built for publication: Minimal generating sets in groups of $p$-automata

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