Abstract
In this paper, we introduce a special class of Büchi automata called unambiguous. In these automata, any infinite word labels exactly one path going infinitely often through final states. The word is accepted by the automaton if this path starts at an initial state. The main result of the paper is that any rational set of infinite words is recognized by such an automaton. We also provide two characterizations of these automata. We finally show that they are well suitable for boolean operations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnold, A.: Rational omega-languages are non-ambiguous. Theoretical Computer Science 26(1-2), 221–223 (1983)
Beauquier, D., Perrin, D.: Codeterministic automata on infinite words. Information Processing Letters 20, 95–98 (1985)
Richard Büchi, J.: On a decision method in the restricted second-order arithmetic. In: Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley, pp. 1–11 (1960); Stanford University Press (1962)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Landweber, L.H.: Decision problems for ω-automata. Math. Systems Theory 3, 376–384 (1969)
McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Control 9, 521–530 (1966)
Mostowski, A.W.: Determinancy of sinking automata on infinite trees and inequalities between various Rabin’s pair indices. Inform. Proc. Letters 15(4), 159–163 (1982)
Mostowski, A.W.: Regular expressions for infinite trees and a standard form for automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 157–168. Springer, Heidelberg (1984)
Muller, D.: Infinite sequences and finite machines. In: Proc. of Fourth Annual IEEE Symp. (eds.): Switching Theory and Logical Design, pp. 3–16 (1963)
Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol. B. Elsevier, Amsterdam (1990)
Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)
Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata and applications to temporal logic. Theoret. Comput. Sci. 49, 217–237 (1987)
Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol. B. Elsevier, Amsterdam (1990)
Moshe, Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carton, O., Michel, M. (2000). Unambiguous Büchi Automata. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_40
Download citation
DOI: https://doi.org/10.1007/10719839_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive