On deciding if deterministic Rabin language is in Büchi class

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 663-674

  Urbański, Tomasz Fryderyk ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

ACCEPTANCE CONDITIONS; CANONICAL FORM; DETERMINISTIC TREE AUTOMATA; INFINITE TREES; NONDETERMINISTIC AUTOMATA; RABIN AUTOMATON;

FORESTRY;

EID: 84974622210     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_56     Document Type: Conference Paper

References (10)

1. J.R. Büchi On a decision method in restricted second order arithmetic, in: Logic, Methodology and Philosophy of Science, Proc. (1960) International Congr. (1962), 1-11.
2. An A. Muchnik Igry na bieskoniecznych dieriewiach i awtomaty s tupikami. Nowoje dokazatielstwo razrieszimosti monadiczieskoj tieorii dwuch sliedowanij, in: Siemiotika (1985), 16-40.
3. D. Niwiński Fixed point characterization of infinite behavior of finite-state systems, Fundamental Study, Theoretical Computer Science 189 Elsevier (1997), 1-69.
4. D. Niwiński, I. Walukiewicz Relating hierarchies of word and tree automata, Proceedings of “15th Annual Symposium on Theoretical Aspects of Computer Science” (STACS), Paris, France (1998), 320-331.
5. M.O. Rabin Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, (1969), 1-35.
6. W. Thomas Automata on infinite objects, in: Handbook of Theoretical Computer Science, Elsevier (1990) 133-191.
7. W. Thomas Languages, automata and logic, Handbook of Formal Languages, Vol.3, Springer-Verlag (1997).
8. T. Wilke, H. Yoo Computing the Rabin index of a regular language of infinite words, Information and Computation Vol.130 (1996), 61-70.
9. M. Otto, Eliminating Recursion in the mu-Calculus, in: Proceedings of STACS’99, LNCS 1563, Springer 1999, 531-540.
10. T.F. Urbański, On decidability of some properties of finite automata on infinite trees, Master of Sci. Thesis, Warsaw University, 1998 (in Polish), English version http://zls.mimuw.edu.pl/~niwinski/Prace/TU.ps.gz.