Iterated pushdown automata and sequences of rational numbers

We introduce a link between automata of level k and tree-structures. This method leads to new decidability results about integer sequences. We also reduce some equality problems for sequences of rational numbers to the equivalence problem for deterministic automata of level k.