Please use this identifier to cite or link to this item:
|Title:||Automata on ordinals and automaticity of linear orders|
|Citation:||Schlicht, P., Stephan, F. (2013-05). Automata on ordinals and automaticity of linear orders. Annals of Pure and Applied Logic 164 (5) : 523-527. ScholarBank@NUS Repository. https://doi.org/10.1016/j.apal.2012.11.007|
|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. © 2012 Elsevier B.V..|
|Source Title:||Annals of Pure and Applied Logic|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 13, 2018
WEB OF SCIENCETM
checked on Jul 4, 2018
checked on Jul 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.