Schreier Graphs of an Extended Version of the Binary Adding Machine

Electronic Journal Of Combinatorics

Daniele D'¹ 

关键词: Schreier graphs;    ends;    automata groups;    bounded automaton.;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In this paper we give a complete classification of the infinite Schreier graphs of an automaton group generated by an extended version of the binary adding machine.

【 授权许可】

Others