Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-21875-0_27
Title: Automata on ordinals and linear orders
Authors: Schlicht, P.
Stephan, F. 
Issue Date: 2011
Citation: Schlicht, P.,Stephan, F. (2011). Automata on ordinals and linear orders. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6735 LNCS : 252-259. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-21875-0_27
Abstract: We investigate structures recognizable by α-automata with running time a limit ordinal α. The domain of such a structure consists of finite α-words with gaps. An α-automaton resembles a finite automaton but has a limit rule which maps the set of states which appear cofinally often before the limit to a limit state. We determine the suprema of the α-automatic ordinals and the ranks of α-automatic linear orders. The power of α-automata increases with every power of ω. © 2011 Springer-Verlag.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/104537
ISBN: 9783642218743
ISSN: 03029743
DOI: 10.1007/978-3-642-21875-0_27
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Feb 23, 2020

Page view(s)

91
checked on Feb 15, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.