I will introduce structures recognizable by finite state automata with an input tape of length a limit ordinal. A reason for studying these structures is that their theory is always uniformly decidable. I will describe a method for proving nonautomaticity and determine the optimal bounds for ranks of linear orders recognized by such automata. This is joint work with Frank Stephan.