| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4661935 | Annals of Pure and Applied Logic | 2013 | 5 Pages |
Abstract
We investigate structures recognizable by finite state automata with an input tape of length a limit ordinal. At limits, the set of states which appear unboundedly often before the limit are mapped to a limit state. We describe a method for proving non-automaticity and apply this to determine the optimal bounds for the ranks of linear orders recognized by such automata.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
