Abstract
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also gives new insights into the latter. Its exponential part coincides with a notion of entropy for some associated automata.
We prove that the Order Problem is decidable when the state-activity is bounded. The Order Problem remains open for the next level of this hierarchy, that is, when the state-activity is linear. Gillibert showed that it is undecidable in the whole family.
The former results are implemented and will be available in the GAP package FR developed by the first author.
Keywords
T. Godin—supported by the Academy of Finland grant 296018.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Akhavi, A., Klimann, I., Lombardy, S., Mairesse, J., Picantin, M.: The finiteness problem for automaton semigroups. Internat. J. Alg. Comput. 22(6), 1–26 (2012)
Bartholdi, L.: Algorithmic decidability of engel’s property for automaton groups. In: Kulikov, A.S., Woeginger, G.J. (eds.) CSR 2016. LNCS, vol. 9691, pp. 29–40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-34171-2_3
Bartholdi, L.: FR-GAP package “Computations with functionally recursive groups”, Version 2.4.3 http://www.gap-system.org/Packages/fr.html (2017)
Bartholdi, L., Mitrofanov, I.: The word and order problems for self-similar and automata groups arXiv:1710.10109 (2017)
Bartholdi, L., Silva, P.V.: Groups defined by automata. In: Pin, J.-É. (ed.) Handbook AutoMathA arXiv:1012.1531 (2018, to appear)
Bondarenko, I., Bondarenko, N., Sidki, S., Zapata, F.: On the conjugacy problem for finite-state automorphisms. Groups Geom. Dyn. 7(2), 323–355 (2013)
Chomsky, N., Miller, G.A.: Finite state languages. Inf. Control 1(2), 91–112 (1958)
Gillibert, P.: The finiteness problem for automaton semigroups is undecidable. Internat. J. Alg. Comput. 24(1), 1–9 (2014)
Gillibert, P.: An automaton group with undecidable order and Engel problems. J. Algebra 497, 363–392 (2018)
Godin, T., Klimann, I.: On bireversible Mealy automata and the Burnside problem. Theor. Comput. Sci. 707, 24–35 (2018)
Klimann, I., Mairesse, J., Picantin, M.: Implementing computations in automaton (Semi)groups. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 240–252. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31606-7_21
Lind, D.A.: The entropies of topological markov shifts and a related class of algebraic integers. Ergodic Theor. Dyn. Syst. 4(2), 283–300 (1984)
Lind, D.A., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, New York (1995)
Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3(2), 114–125 (1959)
Rigo, M.: Advanced Graph Theory and Combinatorics. Wiley, Hoboken (2016)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Shur, A.M.: Combinatorial complexity of regular languages. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 289–301. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-79709-8_30
Shur, A.M.: Comparing complexity functions of a language and its extendable part. RAIRO-Theor. Inf. Appl. 42(3), 647–655 (2008)
Sidki, S.: Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. J. Math. Sci. 100(1), 1925–1943 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Bartholdi, L., Godin, T., Klimann, I., Picantin, M. (2018). A New Hierarchy for Automaton Semigroups. In: Câmpeanu, C. (eds) Implementation and Application of Automata. CIAA 2018. Lecture Notes in Computer Science(), vol 10977. Springer, Cham. https://doi.org/10.1007/978-3-319-94812-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-94812-6_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94811-9
Online ISBN: 978-3-319-94812-6
eBook Packages: Computer ScienceComputer Science (R0)