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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Bedon. Langages reconnaissables de mots indéxés par des ordinaux. Thèse de doctorat, Université de Marne-la-Vallée, 1998. 118
N. Bedon and O. Carton. An Eilenberg theorem for words on countable ordinals. In Claudio L. Lucchesi and Arnaldo V. Moura, editors, Latin’98: Theoretical Informatics, volume 1380 of Lect. Notes in Comput. Sci., pages 53–64. Springer-Verlag, 1998.
V. Bruyère and O. Carton. Automata on linear orderings. In J. Sgall, A. Pultr, and P. Kolman, editors, MFCS’2001, volume 2136 of Lect. Notes in Comput. Sci., pages 236–247, 2001. IGM report 2001–12.
J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math., 6: 66–92, 1960.
J. R. Büchi. Transfinite automata recursions and weak second order theory of ordinals. In Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pages 2–23. North Holland, 1965.
Y. Choueka. Finite automata, definable sets, and regular expressions over con-tapes. J. Comput. System Sci., 17 (1): 81–97, 1978.
D. Girault-Beauquier. Bilimites de langages reconnaissables. Theoret. Comput. Sci., 33 (2–3): 335–342, 1984.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C.E. Shannon, editor, Automata studies, pages 3–41. Princeton university Press, Princeton, 1956.
R. McNaughton and S. Papert.Counter free automata. MIT Press, Cambridge, MA, 1971.
D. Muller. Infinite sequences and finite machines. In Proc. of Fourth Annual IEEE Symp., editor, Switching Theory and Logical Design, pages 3–16, 1963.
M. Nivat and D. Perrin. Ensembles reconnaissables de mots bi-infinis. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 47–59, 1982.
D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 1–57. Elsevier, 1990.
J. G. Rosenstein. Linear ordering. Academic Press, New York, 1982.
M.-P. Schützenberger. On finite monoids having only trivial subgroups. Inform. Control, 8: 190–194, 1965.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133–191. Elsevier, 1990.
J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta informatic, 8 (3–4): 379–396, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bruyère, V., Carton, O. (2002). Hierarchy Among Automata on Linear Orderings. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive