| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429920 | Journal of Computer and System Sciences | 2007 | 24 Pages |
Abstract
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene's theorem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
