Open AccessA Kleene Theorem for Languages of Words Indexed by Linear Orderings
Author(s) -
Alexis Bès,
Olivier Carton
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-26546-5
DOI - 10.1007/11505877_14
Subject(s) - countable set , mathematics , automaton , discrete mathematics , computer science , theoretical computer science
In a preceding paper, Bruyere 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom