当前位置: X-MOL 学术Int. J. Algebra Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On orbits and the finiteness of bounded automaton groups
International Journal of Algebra and Computation ( IF 0.8 ) Pub Date : 2021-06-09 , DOI: 10.1142/s0218196721400087
Ievgen Bondarenko 1 , Jan Philipp Wächter 2
Affiliation  

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state acceptor. This acceptor can also be used to decide whether the bounded automaton acts level-transitively.

中文翻译:

关于有界自动机群的轨道和有限性

我们设计了一个算法,给定一个有界自动机一种, 决定组是否由一种是有限的。解决方案来自对具有无限的无限序列的描述一种-使用确定性有限状态受体的轨道。这个接受器也可以用来决定有界自动机是否是水平传递的。
更新日期:2021-06-09
down
wechat
bug