Abstract
Based on a detailed graph theoretical analysis, Wagner's fundamental results of 1979 are turned into efficient algorithms to compute the Wadge degree, the Lifschitz degree, and the Rabin index of a regular ω-language: the two former can be computed in time O(f 2qb+klogk) and the latter in time O(f 2qb) if the language is represented by a deterministic Muller automaton over an alphabet of cardinality b, with f accepting sets, q states, and k strongly connected components.
Supported by the ESPRIT BRA Working Group No. 6317, ASMICS 2.
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
O. Carton. “Mots Infinis, ω-Semigroupes et Topologie”. PhD thesis, Université Paris 7, France (1993).
D. E. Knuth. “Fundamental Algorithms”, vol. 1. Addison-Wesley (1968). Second edition 1973.
S. C. Krishnan, A. Puri, and R. K. Brayton. Structural complexity of ω-automata. In “STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science”, München (1995), Lecture Notes in Computer Science. Springer-Verlag. To appear.
V. Selivanov. Fine hierarchy of regular ω-languages. This volume.
R. E. Tarjan. Depth first search and linear graphs. SIAM J. Comput. 1(2), 146–160 (1972).
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, “Handbook of Theoretical Computer Science”, vol. B: Formal Methods and Semantics, pp. 134–191. Elsevier Science Publishers B. V. (1990).
R. Van Wesep. Wadge degrees and descriptive set theory. In A. S. Kechris and Y. N. Moschovakis, editors, “Cabal Seminar 76–77”, vol. 689 of “Lecture Notes in Mathematics”, pp. 151–170 (1978). Springer-Verlag.
K. W. Wagner. Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. Elektron. Informationsverarb. Kybernet. 13(9), 473–487 (1977).
K. W. Wagner. On ω-regular sets. Information and Control 43(2), 123–177(1979).
H. Yoo. Ein effizienter Algorithmus zur Bestimmung des Rabin-Index in Muller-Automaten. Diploma thesis, Inst. f. Inform. u. Prakt. Math, CAU Kiel, Germany (1994). 59 pages.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilke, T., Yoo, H. (1995). Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_202
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_202
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive