Finite state machines for strings over infinite alphabets

ACM Transactions on Computational Logic

Volumn 5, Issue 3, 2004, Pages 403-435

  Neven, Frank ^a   Schwentick, Thomas ^b   Vianu, Victor ^c,d  

^a HASSELT UNIVERSITY   (Belgium)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Automata; Expressiveness; First order logic; Infinite alphabets; Monadic second order logic; Pebbles; Registers; XML

Indexed keywords

EXPRESSIVENESS; FIRST-ORDER LOGIC; INFINITE ALPHABETS; MONADIC SECOND-ORDER LOGIC; PEBBLES; REGISTERS;

ALGORITHMS; DECISION MAKING; FORMAL LANGUAGES; PROBLEM SOLVING; WORLD WIDE WEB; XML;

FINITE AUTOMATA;

EID: 3142676414     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1013560.1013562     Document Type: Article

References (31)

1. ABITEBOUL, S., BUNEMAN, P., AND SUCIU, D. 1999. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco, CA.
2. ABITEBOUL, S., HERB, L., AND VAN DEN BUSSCHE, J. 1999. Temporal connectives versus explicit timestamps to query temporal databases. J. Comput. Syst. Sci. 58, 1, 54-68.
3. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
4. AJTAI, M., FAGIN, R., AND STOCKMEYER, L. J. 2000. The closure of monadic NP. J. Comput. Syst. Sci. 60, 3, 660-716.
5. ALON, N., MILO, T., NEVEN, F., SUCIU, D., AND VIANU, V. 2001. XML with data values: Typechecking revisited. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS 2001). ACM Press, New York, NY, 560-572.
6. BEX, G. J., MANETH, S., AND NEVEN, F. 2002. A formal model for an expressive fragment of XSLT. Inform. Syst. 27, 1, 21-39.
7. CHANDRA, A. K., KOZEN, D., AND STOCKMEYER, L. 1981. Alternation. J. ACM 28, 1, 114-133.
8. COURCELLE, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, vol. B, chap. 5, J. van Leeuwen, Ed. Elsevier, Amsterdam, The Netherlands.
9. EBBINGHAUS, H.-D. AND FLUM, J. 1999. Finite Model Theory, 2nd ed. Springer, Berlin, Germany.
10. GLOBERMAN, N. AND HAREL, D. 1996. Complexity results for two-way and multi-pebble automata and their logics. Theoret. Comput. Sci. 169, 2, 161-184.
11. GRÄDEL, E. AND GUREVICH, Y. 1998. Metafinite model theory. Inform. Computat. 140, 1, 26-81.
12. GREENLAW, R., HOOVER, H., AND RUZZO, W. L. 1995. Limits to Parallel Computation. P-Completeness Theory. Oxford University Press, Oxford, U.K.
13. HENNIE, F. C. 1965. One-tape, off-line turing machine computations. Inform. Contr. 8, 6, 553-578.
14. HOFCROFT, J. AND ULLMAN, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
15. HROMKOVIC, J. 2000. Communication Complexity and Parallel Computing. Texts in Theoretical Computer Science - An EATCS Series. Springer-Verlag, Berlin, Germany.
16. KAMINSKI, M. AND FRANCEZ, N. 1990. Finite-memory automata. In Proceedings of 31th IEEE Symposium on Foundations of Computer Science (FOCS). 683-688.
17. KAMINSKI, M. AND FRANCEZ, N. 1994. Finite-memory automata. Theoret. Comput. Sci. 134, 2, 329-363.
18. LADNER, R. E., LIPTON, R. J., AND STOCKMEYER, L. J. 1984. Alternating pushdown and stack automata. SIAM J. Comput. 13, 1, 135-155.
19. MILO, T., SUCIU, D., AND VIANU, V. 2000. Type checking for XML transformers. In Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems. ACM Press, New York, NY, 11-22.
20. NEVEN, F. 2002a. Automata, logic, and XML. In CSL, J. C. Bradfield, Ed. Lecture Notes in Computer Science, vol. 2471. Springer, Berlin, Germany, 2-26.
21. NEVEN, F. 2002b. On the power of walking for querying tree-structured data. In Proceedings of the 21th Symposium on Principles of Database Systems (PODS 2002). ACM Press, New York, NY, 77-84.
22. NEVEN, F. AND SCHWENTICK, T. 2000. Expressive and efficient pattern languages for tree-structured data. In Proceedings of the 19th Symposium on Principles of Database Systems (PODS 2000). New York, NY, 145-156.
23. NEVEN, F. AND SCHWENTICK, T. 2002. Query automata on finite trees. Theoret. Comput. Sci. 275, 633-674.
24. OTTO, F. 1985. Classes of regular and context-free languages over countably infinite alphabets. Discrete Appl. Math. 12, 41-56.
25. PAPAKONSTANTINOU, Y. AND VIANU, V. 2001. DTD inference for views of XML data. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS 2001). ACM Press, New York, NY, 35-46.
26. SAKAMOTO, H. AND IKEDA, D. 2000. Intractability of decision problems for finite-memory automata. Theoret. Comput. Sci. 231, 2, 297-308.
27. SHEFHERDSON, J. C. 1959. The reduction of two-way automata to one-way automata. IBM J. Res. Develop. 3, 198-200.
28. SIPSER, M. 1980. Halting space-bounded computations. Theoret. Comput. Sci. 10, 335-338.
29. SUDBOROUGH, I. H. 1975. On tape-bounded complexity classes and multihead finite automata. J. Comput. Syst. Sci. 10, 1, 62-76.
30. THOMAS, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages, vol. 3, chap. 7, G. Rozenberg and A. Salomaa, Eds. Springer, Berlin, Germany, 389-456.
31. VIANU, V. 2001. A Web odyssey: From Codd to XML. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS 2001). ACM Press, New York, NY, 1-15.