A Kleene Theorem for Languages of Words Indexed by Linear Orderings

@inproceedings{Bs2005AKT,
  title={A Kleene Theorem for Languages of Words Indexed by Linear Orderings},
  author={Alexis B{\`e}s and Olivier Carton},
  booktitle={Developments in Language Theory},
  year={2005}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…