Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet

DOI10.1016/j.tcs.2020.12.036OpenAlexW3113968068MaRDI QIDQ2219066

Veronika Prokhorchuk

Publication date: 19 January 2021

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.036

zbMATH Keywords

finite automatonamalgamated free productprofinite groupresidually finite group

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Limits, profinite groups (20E18)

Related Items (1)

Minimal generating sets in groups of $p$-automata

Cites Work

• Finite state wreath powers of transformation semigroups.
• Automata generating free products of groups of order 2.
• On a series of finite automata defining free transformation groups.
• The ubiquity of free subgroups in certain inverse limits of groups
• Amalgams of \(p\)-groups.
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• Generic groups acting on regular trees
• Faithful Group Actions on Rooted Trees Induced by Actions of Quotients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet