Systolic tree ω-languages: The operational and the logical view

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 1-18

  Monti, Angelo ^a   Peron, Adriano ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Automata on words; Decidable monadic second order logic; Systolic automata

Indexed keywords

EID: 0005644099     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00257-0     Document Type: Article

References (9)

1. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Proc. Internat. Congress on Logic, Methodology and Philosophy of Science, Stanford Univ. Press, Stanford, 1960, pp. 1-11.
2. K. Culik II, A. Salomaa, D. Wood, Systolic tree acceptors, R.A.I.R.O Informatique Théorique 18 (1984) 53-69.
3. C.C. Elgot, M.O. Rabin, Decidability and undecidability of extensions of second (first) order theory of (generalized) successor, J. Symbol. Logic 31 (1966) 169-181.
4. E.A. Emerson, C.D. Lei, Modalities for model checking: branching time strikes back, in: Proc. 12th ACM Symp. on Principles of Programming Languages, New Orleans, 1985, pp. 84-96.
5. J. Gruska, Synthesis, structure and power of systolic computations, Theoret. Comput. Sci. 71 (1990) 47-78.
6. A. Monti, A. Peron, Systolic tree ω-languages, in: Proc. STACS'95, Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995, pp. 131-142.
7. A. Monti, A. Roncato, On the complexity of some reachability problems, Inform. Process. Lett. 53 (1995) 11-16.
8. A.P. Sistla, M.Y. Vardi, P. Wolper, The complementation problem for Büchi automata with application to temporal logic, Theoret. Comput. Sci. 49 (1987) 217-237.
9. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 133-191.