scholarly journals A Kleene Theorem for Languages of Words Indexed by Linear Orderings

Author(s):  
Alexis Bès ◽  
Olivier Carton
2006 ◽  
Vol 17 (03) ◽  
pp. 519-541 ◽  
Author(s):  
ALEXIS BÈS ◽  
OLIVIER CARTON

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.


Order ◽  
2007 ◽  
Vol 23 (4) ◽  
pp. 321-331 ◽  
Author(s):  
Antonio Montalbán
Keyword(s):  

2010 ◽  
Vol 262 ◽  
pp. 65-81
Author(s):  
Davide Bresolin ◽  
Dario Della Monica ◽  
Valentin Goranko ◽  
Angelo Montanari ◽  
Guido Sciavicco
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document