From bidirectionality to alternation

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 295-321

  Piterman, Nir ^a   Vardi, Moshe Y ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Rice University   (United States)

Author keywords

Alternating B chi automata; Alternating finite automata; Nondeterministic B chi automata; Nondeterministic finite automata; Two way automata

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; SET THEORY; THEOREM PROVING;

TWO-WAY AUTOMATA;

FINITE AUTOMATA;

EID: 0037463543     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00410-3     Document Type: Conference Paper

References (31)

1. Birget J. State-complexity of finite-state devices, state compressibility and incompressibility. Math. Systems Theory. 26(3):1993;237-269.
2. Brzozowski J., Leiss E. Finite automata and sequential networks. Theoret. Comput. Sci. 10:1980;19-35.
3. J. BüchiOn a decision method in restricted second order arithmeticProc. Internat. Cong. Logic, Method. and Philos. Sci. 1960, Stanford University Press, Stanford, CA, 1962, pp. 1-12.
4. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Vardi, View-based query processing for regular path queries with inverse, in: Proc. ACM 19th Symp. on Principles of Database Systems, 2000, pp. 58-66.
5. Chandra A., Kozen D., Stockmeyer L. Alternation. J. Assoc. Comput. Mach. 28(1):1981;114-133.
6. Choueka Y. Theories of automata on. ω -tapes a simplified approach J. Comput. System Sci. 8:1974;117-141.
7. E. Emerson, C. Jutla, Tree automata, μ -calculus and determinacy, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science, San Juan, 1991, pp. 368-377.
8. Globerman N., Harel D. Complexity results for two-way and multi-pebble automata and their logics. Theoret. Comput. Sci. 143:1996;161-184.
9. G. Holzmann, O. Kupferman, Not checking for closure under stuttering, in: Proc. 2nd Internat. SPIN Workshop, The Spin Verification System, American Mathematical Society, Providence, RI, 1996, pp. 17-22.
10. Johnson W., Porter J., Ackley S., Ross D. Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM. 11(12):1968;805-813.
11. Kohavi Z. Switching and Finite Automata Theory. 1970;McGraw-Hill, New York.
12. O. Kupferman, M. Vardi, Weak alternating automata are not that weak, in: Proc. 5th Israeli Symp. on Theory of Computing and Systems, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 147-158.
13. O. Kupferman, M.Y. Vardi, An automata-theoretic approach to reasoning about infinite-state systems, in: Computer Aided Verification, Proc. 12th International Conference, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 36-52.
14. Kurshan R. Computer Aided Verification of Coordinating Processes. 1994;Princeton University Press, Princeton, NJ.
15. Ladner R., Lipton R., Stockmeyer L. Alternating pushdown and stack automata. SIAM J. Comput. 13(1):1984;135-155.
16. McNaughton R. Testing and generating infinite sequences by a finite automaton. Inform. Control. 9:1966;521-530.
17. Miyano S., Hayashi T. Alternating finite automata on. ω -words Theoret. Comput. Sci. 32:1984;321-330.
18. Muller D., Schupp P. Alternating automata on infinite trees. Theoret. Comput. Sci. 54:1987;267-276.
19. Rabin M. Decidability of second order theories and automata on infinite trees. Trans. AMS. 141:1969;1-35.
20. Rabin M., Scott D. Finite automata and their decision problems. IBM J. Research and Development. 3:1959;115-125.
21. Ruzzo W. Tree-size bounded alternation. J. Comput. System Sci. 21:1980;218-235.
22. W. Sakoda, M. Sipser, Nondeterminism and the size of two way finite automata, in: 10th ACM Symp. on Theory of Computing, San Diego, CA, 1978, pp. 275-286.
23. Shepherdson J.C. The reduction of two-way automata to one-way automata. IBM J. Research and Development. 3:1959;198-200.
24. Streett R. Propositional dynamic logic of looping and converse. Inform. Control. 54:1982;121-141.
25. M. Vardi, A temporal fixpoint calculus, in: Proc. 15th ACM Symp. on Principles of Programming Languages, San Diego, 1988, pp. 250-259.
26. Vardi M. A note on the reduction of two-way automata to one-way automata. Inform. Process. Lett. 30(5):1989;261-264.
27. Vardi M. Endmarkers can make a difference. Inform. Process. Lett. 35(3):1990;145-148.
28. Vardi M. Reasoning about the past with two-way automata. Proc. 25th Internat. Colloq. on Automata, Languages, and Programming. Lecture Notes in Computer Science. Vol. 1443:1998;628-641 Springer, Berlin.
29. M. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, in: Proc. 1st Symp. on Logic in Computer Science, Cambridge, 1986, pp. 332-344.
30. Venkateswaran H. Properties that characterize LOGCFL. J. Comput. System Sci. 43(2):1991;380-404.
31. + is exponentially more succinct than CTL, in: Proc. 19th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 1738, Springer, Berlin, 1999, pp. 110-121.