Towards regular languages over infinite alphabets

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

Volumn 2136, Issue , 2001, Pages 560-572

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

^a HASSELT UNIVERSITY   (Belgium)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

CONSERVATIVE EXTENSIONS; DECISION PROBLEMS; EXTENSIONS OF FIRST-ORDER LOGIC; FINITE ALPHABET; FORMAL MODEL; MONADIC SECOND-ORDER LOGIC; TWO WAYS;

AUTOMATA THEORY;

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

References (21)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
2. S. Abiteboul, L. Herr, and J. Van den Bussche. Temporal connectives versus explicit timestamps to query temporal databases. Journal of Computer and System Sciences, 58(1):54-68, 1999.
3. N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with Data Values: Typechecking Revisited. To be presented at LICS 2001.
4. J. Clark XSL Transformations (XSLT) specification, 1999. http://www.w3.org/ TR/WD-xslt.
5. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume 3. Springer, 1997.
6. E. Grädel and Y. Gurevich. Metafinite model theory. Information and Computation, 140(1):26-81, 1998.
7. N. Globerman and D. Harel. Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science, 169(2):161-184, 1996.
8. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
9. J. Hromkovič. Communication Complexity and Parallel Computing. Springer-Verlag, 2000.
10. M. Kaminski and N. Francez. Finite-memory automata. In Proceedings of 31th IEEE Symposium on Foundations of Computer Science (FOCS), pages 683-688, 1990.
11. M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329-363, 1994.
12. A. K. Chandra, L. J. Stockmeyer. Alternation. In Proceedings of 17th IEEE Symposium on Foundations of Computer Science (FOCS 1976), 98-108, 1976.
13. S. Maneth and F. Neven. Structured document transformations based on XSL. In R. Connor and A.Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming (DBPL’99), volume 1949 of Lecture Notes in Computer Science, pages 79-96. Springer, 2000.
14. T. Milo, D. Suciu, and V. Vianu. Type checking for XML transformers. In Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems, pages 11-22. ACM Press, 2000..
15. F. Neven. Extensions of attribute grammars for structured document queries. In R. Connor and A.Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming (DBPL’99), volume 1949 of Lecture Notes in Computer Science, pages 97-114. Springer, 2000.
16. F. Neven and T. Schwentick. Query automata. In Proceedings of the 18th ACM Symposium on Principles of Database Systems (PODS 1999), pages 205-214. ACM Press, 1999.
17. F. Neven and T. Schwentick. Expressive and efficient pattern languages for treestructured data. In Proceedings of 19th ACM Symposium on Principles of Database Systems (PODS 2000), Dallas, pages 145-156, 2000.
18. F. Neven and J. Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. In Proceedings of 17th ACM Symposium on Principles of Database Systems (PODS 1998), pages 11-17. ACM Press, 1998.
19. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proceedings of 19th ACM Symposium on Principles of Database Systems (PODS 2000), pages 35-46. ACM, Press 2000.
20. I. H. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10(1):62-76, 1975.
21. W. Thomas. Languages, automata, and logic. In Rozenberg and Salomaa [5], chapter 7.