Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Theoretical Computer Science - Special issue on hybrid systems
Accepting Zeno Words Without Making Time Stand Still
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Accessibility in Automata on Scattered Linear Orderings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
An Eilenberg Theorem for Words on Countable Ordinals
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Ensembles reconnaissables de mots biinfinis
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
An Analysis of the Fuller Phenomenon on Transfinite Hybrid Automata
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Context-Free Languages of Countable Words
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Regular and algebraic words and ordinals
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
The complexity of temporal logic with until and since over ordinals
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Craig interpolation for linear temporal languages
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On Müller context-free grammars
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Theoretical Computer Science
Regular languages of words over countable linear orderings
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On Müller context-free grammars
Theoretical Computer Science
Schützenberger and Eilenberg theorems for words on linear orderings
Journal of Computer and System Sciences
Hausdorff rank of scattered context-free linear orders
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
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.