  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.
