Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
