Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s00224-005-1129-2 | Theory of Computing Systems \/ Mathematical Systems Theory |
Keywords | DocType | Volume |
Computational Mathematic,Linear Ordering,Rational Expression,Preceding Paper,Rational Operation | Journal | 38 |
Issue | ISSN | ISBN |
5 | 1432-4350 | 1-4020-7181-7 |
Citations | PageRank | References |
8 | 0.82 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Véronique Bruyère | 1 | 429 | 43.59 |
| Olivier Carton | 2 | 381 | 40.97 |