On groups generated by bi-reversible automata: the two-state case over a changing alphabet

DOI10.1016/j.jcss.2017.01.004zbMath1370.68193arXiv1702.00435OpenAlexW2574325846MaRDI QIDQ2396829

Adam Woryna

Publication date: 26 May 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupfree groupchanging alphabettransducerautomaton over a changing alphabetmealy automatongroup generated by automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

The lamplighter group of rank two generated by a bireversible automaton

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automaton semigroups: the two-state case.
• The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
• The concept of duality for automata over a changing alphabet and generation of a free group by such automata
• Discrete groups of slow subgroup growth
• On a series of finite automata defining free transformation groups.
• Uncountable universal locally finite groups
• Residual properties of free groups. III
• Automata and square complexes.
• The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
• Freeness of automaton groups vs boundary dynamics
• On a free group of transformations defined by an automaton.
• The Lamplighter Group ℤ₃≀ℤ Generated by a Bireversible Automaton
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
• Representations of a free group of rank two by time-varying Mealy automata