Article Dans Une Revue Theory of Computing Systems Année : 2005

Hierarchy among Automata on Linear Orderings

Résumé

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.

Fichier principal
Vignette du fichier
hierarchy.pdf (251.37 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00161039 , version 1 (09-07-2007)

Licence

Identifiants

  • HAL Id : hal-00161039 , version 1

Citer

Véronique Bruyère, Olivier Carton. Hierarchy among Automata on Linear Orderings. Theory of Computing Systems, 2005, 38 (5), pp.593-621. ⟨hal-00161039⟩
96 Consultations
279 Téléchargements

Partager

  • More