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.

Full Text
Published version (Free)

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 call