| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662472 | Annals of Pure and Applied Logic | 2006 | 49 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
