Groups: Automorphisms of the binary tree: state-closed subgroups and dynamics of 1/2-endomorphisms

By Volodymyr V. Nekrashevych, Said Najati Sidki. 2004

65 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/73012c203a65a93b143460a22c47cb705c0ee6e7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Said Najati Sidki
2. Volodymyr V. Nekrashevych
3. Rostislav I. Grigorchuk
4. Zoran Sunic

Citations in the corpus

• Finite Automata of Polynomial Growth do Not Generate A Free Group (2004, background): “The known noncyclic free groups generated by finite automata – for example, those constructed in [1, 2 ] – have generators of exponential growth.”