Skip to main content
SpringerLink
Log in

Towards Regular Languages over Infinite Alphabets

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 2001 (MFCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2136))

Abstract

Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble automata, and extensions of first-order logic and monadic second-order logic. For each type of automaton we consider oneway and two-way variants, as well as deterministic, non-deterministic, and alternating control. We investigate the expressiveness and complexity of the automata, their connection to the logics, as well as standard decision problems.

Post-doctoral researcher of the Fund for Scientific Research, Flanders.

This author supported in part by the National Science Foundation under grant number IIS-9802288.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with Data Values: Typechecking Revisited. To be presented at LICS 2001.

    Google Scholar 

  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.

    Google Scholar 

  6. E. Grädel and Y. Gurevich. Metafinite model theory. Information and Computation, 140(1):26–81, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  9. J. Hromkovic. Communication Complexity and Parallel Computing. Springer-Verlag, 2000.

    Google Scholar 

  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.

    Google Scholar 

  11. M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329–363, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. K. Chandra, L. J. Stockmeyer. Alternation. In Proceedings of 17th IEEE Symposium on Foundations of Computer Science (FOCS 1976), 98–108, 1976.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  17. F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. In Proceedings of 19th ACM Symposium on Principles of Database Systems (PODS 2000), Dallas, pages 145–156, 2000.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  20. I. H. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10(1):62–76, 1975.

    MATH  MathSciNet  Google Scholar 

  21. W. Thomas. Languages, automata, and logic. In A. Salomaa, editors. Handbook of Formal Languages, volume 3. Springer, 1997 Rozenberg and Salomaa [5], chapter 7.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Limburgs Universitair Centrum, Germany

    Frank Neven

  2. Friedrich-Schiller-Universität Jena, Germany

    Thomas Schwentick

  3. U.C. San Diego, Germany

    Victor Vianu

Authors
  1. Frank Neven
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Schwentick
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor Vianu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neven, F., Schwentick, T., Vianu, V. (2001). Towards Regular Languages over Infinite Alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation