From bidirectionality to alternation

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

Volumn 2136, Issue , 2001, Pages 598-610

  Piterman, Nir ^a   Vardi, Moshe Y ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

ALTERNATING AUTOMATA; BIDIRECTIONALITY; BLOW-UP; FINITE WORDS; INFINITE WORD; NONDETERMINISTIC AUTOMATA;

AUTOMATA THEORY;

EID: 84937567947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_52     Document Type: Conference Paper

References (25)

1. J. C. Birget. State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory, 26(3):237-269, 1993..
2. J. A. Brzozowski and E. Leiss. Finite automata and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
3. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
4. D. Calvanese, G. de Giacomo, M. Lenzerini, and M. Y. Vardi. View-based query processing for regular path queries with inverse. In 19th PODS, 58-66, ACM, 2000.
5. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114-133, January 1981.
6. N. Globerman and D. Harel. Complexity results for two-way and multipebble automata and their logics. TCS, 143:161-184, 1996.
7. W. L. Johnson, J. H. Porter, S. I. Ackley, and D. T. Ross. Automatic generation of efficient lexical processors using finite state techniques. Communications of the ACM, 11(12):805-813, 1968.
8. Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill, New York, 1970.
9. R. P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
10. O. Kupferman and M. Y. Vardi. Synthesis with incomplete informatio. In Advances in Temporal Logic, pages 109-127. Kluwer Academic Publishers, January 2000.
11. Richard E. Ladner, Richard J. Lipton, and Larry J. Stockmeyer. Alternating pushdown and stack automata. SIAM Journal on Computing, 13(1):135-155, 1984.
12. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
13. S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
14. M. O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
15. M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
16. W. Ruzzo. Tree-size bounded alternation. JCSS, 21:218-235, 1980.
17. J. C. Shepherdson. The reduction of two-way automata to one-way automata. IBM Journal of Research and Development, 3:198-200, 1959.
18. W. J. Sakoda and M. Sipser. Nondeterminism and the size of two way finite automata. In 10th STOC, 275-286, 1978. ACM.
19. R. S. Streett. Propositional dynamic logic of looping and converse. Information and Control, 54:121-141, 1982.
20. M. Y. Vardi. A temporal fixpoint calculus. In Proc. 15th ACM Symp on Principles of Programming Languages, 250-259, 1988.
21. M. Y. Vardi. A note on the reduction of two-way automata to one-way automata. Information Processing Letters, 30(5):261-264, March 1989.
22. M. Y. Vardi. Endmarkers can make a difference. Information Processing Letters, 35(3):145-148, July 1990.
23. M. Y. Vardi. Reasoning about the past with two-way automata. In 25th ICALP, LNCS 1443, 628-641. Springer-Verlag, July 1998.
24. H. Venkateswaran. Properties that characterize logCFL. JCSS, 43(2):380-404, 1991.
25. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In 1st LICS, 332-344, 1986.