Article (Scientific journals)
Hierarchy Among Automata on Linear Orderings
Bruyère, Véronique; Carton, Olivier
2005In Theory of Computing Systems, 38, p. 593-621
Peer Reviewed verified by ORBi
 

Files


Full Text
Bruyere-2005-4-journal.pdf
Author postprint (557.62 kB)
Request a copy

All documents in ORBi UMONS are protected by a user license.

Send to



Details



Abstract :
[en] In a preceding paper, automata and rational expressions have been introduced for words indexed by linear orderings, together with a Kleene-like theorem. We here pursue this work by proposing a hierarchy among the rational sets. Each class of the hierarchy is defined by a subset of the rational operations that can be used. We then characterize any class by an appropriate class of automata, leading to a Kleene theorem inside the class. A characterization by particular classes of orderings is also given.
Disciplines :
Electrical & electronics engineering
Mathematics
Author, co-author :
Bruyère, Véronique  ;  Université de Mons > Faculté des Sciences > Service d'Informatique théorique
Carton, Olivier
Language :
English
Title :
Hierarchy Among Automata on Linear Orderings
Publication date :
01 September 2005
Journal title :
Theory of Computing Systems
ISSN :
1432-4350
Publisher :
Springer, Germany
Volume :
38
Pages :
593-621
Peer reviewed :
Peer Reviewed verified by ORBi
Research unit :
S829 - Informatique théorique
Available on ORBi UMONS :
since 10 June 2010

Statistics


Number of views
1 (0 by UMONS)
Number of downloads
0 (0 by UMONS)

Scopus citations®
 
1
Scopus citations®
without self-citations
1

Bibliography


Similar publications



Contact ORBi UMONS