Skip to Main content Skip to Navigation
Journal articles

A Kleene Theorem for Languages of Words Indexed by Linear Orderings

Abstract : 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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00160976
Contributor : Olivier Carton <>
Submitted on : Monday, July 9, 2007 - 3:39:20 PM
Last modification on : Saturday, March 28, 2020 - 2:08:06 AM
Document(s) archivé(s) le : Thursday, April 8, 2010 - 10:45:21 PM

File

article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00160976, version 1

Collections

Citation

Alexis Bès, Olivier Carton. A Kleene Theorem for Languages of Words Indexed by Linear Orderings. International Journal of Foundations of Computer Science, World Scientific Publishing, 2006, 17 (3), pp.519-542. ⟨hal-00160976⟩

Share

Metrics

Record views

199

Files downloads

220