Abstract
In a preceding paper, automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata on transfinite words introduced by Büchi. In this paper, we show that if only words indexed by scattered linear orderings are considered, the accessibility and the emptiness in these automata can be checked in time nm 2 where n and m are the number of states and the number of transitions. This solves the problem for automata on transfinite words.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1–11. Stanford University Press, 1962.
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 ωn- tapes. J. Comput. System Sci., 17(1):81–97, 1978.
S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, New York, 1972.
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.
S. C. Krishnan, A. Puri, and R. K. Brayton. Structural complexity of ω-languages. In STACS’ 95, volume 900 of Lect. Notes in Comput. Sci., pages 143–156, Berlin, 1995. Springer-Verlag.
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.
M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1–35, 1969.
E. Roche and Y. Schabes. Finite-State Language Processing, chapter 7. MIT Press, Cambridge, 1997.
J. G. Rosenstein. Linear ordering. Academic Press, New York, 1982.
M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, volume 1043 of Lect. Notes in Comput. Sci., pages 238–266. Springer-Verlag, 1996.
T. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Inform. Comput., 130(1):61–70, 1996.
J. Wojciechowski. Classes of transfinite sequences accepted by finite automata. Fundamenta informaticæ, 7(2):191–223, 1984.
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-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carton, O. (2002). Accessibility in Automata on Scattered Linear Orderings. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive