Class of differentiable invertible automatous with an algorithmically solvable conjugacy problem.

Автор(и)

  • Denis Morozov Department of Computer Science, National University of “Kyiv-Mohyla Academy”, Kyiv, Ukraine

Ключові слова:

Finite-state automata, p-adic, conjugacy problem

Анотація

In this abstracts conjugacy problem in the group of finite-state automorphisms of rooted binary tree investigated.

Посилання

Zoran Sunic, Enric Ventura, The conjugacy problem in automaton groups is not solvable, DOI:10.1016/j.jalgebra.2012.04.014 54 (2012).

Morozov Denis, Linear automatous which are finite-state conjugated. // Conf. "Groups generated by automata" in Switzerlend: Abstr. Ascona, February, 2008

##submission.downloads##

Номер

Збірник тез доповідей

Розділ

Тези доповідей