Minimal generating sets in groups of $p$-automata

DOI10.15330/cmp.15.2.608-613OpenAlexW4390439725MaRDI QIDQ6187202

A. S. Oliynyk, Yaroslav Lavrenyuk

Publication date: 31 January 2024

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

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

zbMATH Keywords

finite automatonminimal generating set\(p\)-automaton

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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.
• Finite state wreath powers of transformation semigroups.
• Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet
• On finite state automaton actions of HNN extensions of free abelian groups
• Free groups defined by finite $p$-automata
• On exponentiation, p-automata and HNN extensions of free abelian groups

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