{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:10:56Z","timestamp":1754194256684},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p> We devise an algorithm which, given a bounded automaton [Formula: see text], decides whether the group generated by [Formula: see text] is finite. The solution comes from a description of the infinite sequences having an infinite [Formula: see text]-orbit using a deterministic finite-state acceptor. This acceptor can also be used to decide whether the bounded automaton acts level-transitively. <\/jats:p>","DOI":"10.1142\/s0218196721400087","type":"journal-article","created":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T06:46:43Z","timestamp":1623394003000},"page":"1177-1190","source":"Crossref","is-referenced-by-count":2,"title":["On orbits and the finiteness of bounded automaton groups"],"prefix":"10.1142","volume":"31","author":[{"given":"Ievgen","family":"Bondarenko","sequence":"first","affiliation":[{"name":"Mechanics and Mathematics Faculty, Taras Shevchenko National University of Kyiv, vul.Volodymyrska 64, Kyiv 01033, Ukraine"}]},{"given":"Jan Philipp","family":"W\u00e4chter","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr formale Methoden der Informatik, Universit\u00e4t Stuttgart, Universit\u00e4tsstra\u00dfe 38, 70569 Stuttgart, Germany"}]}],"member":"219","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"S0218196721400087BIB001","doi-asserted-by":"publisher","DOI":"10.4171\/GGD\/560"},{"key":"S0218196721400087BIB002","doi-asserted-by":"publisher","DOI":"10.4171\/GGD\/184"},{"key":"S0218196721400087BIB003","first-page":"369-424","volume":"4","author":"Bondarenko I.","year":"2017","journal-title":"J. Fract. Geom."},{"key":"S0218196721400087BIB004","doi-asserted-by":"publisher","DOI":"10.11606\/issn.2316-9028.v1i1p1-39"},{"key":"S0218196721400087BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196714500015"},{"key":"S0218196721400087BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2017.11.049"},{"key":"S0218196721400087BIB008","first-page":"128","volume":"231","author":"Grigorchuk R. I.","year":"2000","journal-title":"Proc. Steklov Inst. Math."},{"key":"S0218196721400087BIB009","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"S0218196721400087BIB010","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/117"},{"key":"S0218196721400087BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/BF02677504"},{"key":"S0218196721400087BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2012.04.014"},{"key":"S0218196721400087BIB014","first-page":"6:1","volume-title":"37th Int. Symp. Theoretical Aspects of Computer Science, STACS 2020","author":"W\u00e4chter J. Ph.","year":"2020"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196721400087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T18:33:07Z","timestamp":1630953187000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196721400087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":12,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10.1142\/S0218196721400087"],"URL":"https:\/\/doi.org\/10.1142\/s0218196721400087","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,9]]}}}