LATIN 2000: LATIN 2000: Theoretical Informatics pp 407-416 | Cite as
Unambiguous Büchi Automata
Conference paper
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.
Keywords
Temporal Logic Linear Temporal Logic Acceptance Condition Simple CUBA Deterministic Automaton
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.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Arnold, A.: Rational omega-languages are non-ambiguous. Theoretical Computer Science 26(1-2), 221–223 (1983)MATHCrossRefMathSciNetGoogle Scholar
- 2.Beauquier, D., Perrin, D.: Codeterministic automata on infinite words. Information Processing Letters 20, 95–98 (1985)MATHCrossRefMathSciNetGoogle Scholar
- 3.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)Google Scholar
- 4.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
- 5.Landweber, L.H.: Decision problems for ω-automata. Math. Systems Theory 3, 376–384 (1969)MATHCrossRefMathSciNetGoogle Scholar
- 6.McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Control 9, 521–530 (1966)MATHCrossRefMathSciNetGoogle Scholar
- 7.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)MATHCrossRefMathSciNetGoogle Scholar
- 8.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)Google Scholar
- 9.Muller, D.: Infinite sequences and finite machines. In: Proc. of Fourth Annual IEEE Symp. (eds.): Switching Theory and Logical Design, pp. 3–16 (1963) Google Scholar
- 10.Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol. B. Elsevier, Amsterdam (1990)Google Scholar
- 11.Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)MATHMathSciNetGoogle Scholar
- 12.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)MATHCrossRefMathSciNetGoogle Scholar
- 13.Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol. B. Elsevier, Amsterdam (1990)Google Scholar
- 14.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)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2000