A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Kleene Theorem for Languages of Words Indexed by Linear Orderings
[chapter]
2005
Lecture Notes in Computer Science
In a preceding paper, Bruyère and Carton introduced automata, as well as rational expressions, which allow to deal with words indexed by linear orderings. A Kleene-like theorem was proved for words indexed by countable scattered linear orderings. In this paper we extend this result to languages of words indexed by all linear orderings. Words and rational expressions Given a finite alphabet A, a word (a j ) j∈J is a function from J to A which maps any element j of J to a letter a j of A. We say
doi:10.1007/11505877_14
fatcat:lpwwn7tidzg3zjrlmo7vkgnjoy