On some algorithmic properties of finite state automorphisms of rooted trees. (Q2944019)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On some algorithmic properties of finite state automorphisms of rooted trees. |
scientific article; zbMATH DE number 6479066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some algorithmic properties of finite state automorphisms of rooted trees. |
scientific article; zbMATH DE number 6479066 |
Statements
7 September 2015
0 references
finite state automorphisms
0 references
regular rooted trees
0 references
automata
0 references
spherical transitivity
0 references
iterated wreath products
0 references
rational power series
0 references
word problem
0 references
0.8137905597686768
0 references
0.7826027870178223
0 references
0.7771300077438354
0 references
0.771731972694397
0 references
