On some algorithmic properties of finite state automorphisms of rooted trees.

zbMATH Open1326.20037MaRDI QIDQ2944019FDOQ2944019

Authors: Benjamin Steinberg 

Publication date: 7 September 2015

Recommendations

• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• scientific article; zbMATH DE number 2058922
• On conjugacy in groups of finite-state automorphisms of rooted trees
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Finite automata of polynomial growth do not generate a free group.

zbMATH Keywords

iterated wreath productsautomataword problemrational power seriesregular rooted treesfinite state automorphismsspherical transitivity

Mathematics Subject Classification ID

Groups acting on trees (20E08) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (12)

• On the structure theory of partial automaton semigroups
• On the complexity of the word problem for automaton semigroups and automaton groups
• An automaton group with undecidable order and Engel problems
• The action of finite-state tree automorphisms on Bernoulli measures
• The word problem for finitary automaton groups
• Orbit automata as a new tool to attack the order problem in automaton groups
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• A branch group in a class of non-contracting weakly regular branch groups
• On level-transitivity and exponential growth
• An automaton group with \textsf{PSPACE}-complete word problem
• Title not available (Why is that?)
• On the classification of automorphisms of trees

This page was built for publication: On some algorithmic properties of finite state automorphisms of rooted trees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944019)