Skip to main content
SpringerLink
Log in

Regular Expressions for Languages over Infinite Alphabets

  • Conference paper
Book cover Computing and Combinatorics (COCOON 2004)

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

Included in the following conference series:

Abstract

In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is acceptable by finite-state unification based automaton – a model of computation that is tightly related to other models of automata over infinite alphabets.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bielecki, M., Hidders, J., Paredaens, J., Tyszkiewicz, J., Van den Bussch, J.: Navigating with a browser. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 764–775. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Bolling, B., Leucker, M., Noll, T.: Generalized regular MSA languages. Technical report, Department of Computer Science, Aachen University of Technology (2002)

    Google Scholar 

  3. Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, Los Alamitis, CA, pp. 683–688. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  4. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science A 138, 329–363 (1994)

    Article  MathSciNet  Google Scholar 

  5. Lewis, H.R., Papadimitriou, C.H.: Elements of the theory of computation. Prentice-Hall, Inc., Englewood Cliffs (1981)

    MATH  Google Scholar 

  6. Neven, F., Schwentik, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 560–572. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Shemesh, Y., Francez, N.: Finite-state unification automata and relational languages. Information and Computation 114, 192–213 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Tal. Decidability of inclusion for unification based automata. M.Sc. thesis, Department of Computer Science, Technion – Israel Institute of Technology (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department. of Computer Science, Technion - Israel Institute of Technology, Haifa, 32000, Israel

    Michael Kaminski

  2. School of Computing, National University of Singapore, 3 Science Drive 2, Singapore, 117543

    Tony Tan

Authors
  1. Michael Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tony Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea

    Kyung-Yong Chwa

  2. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    J. Ian J. Munro

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaminski, M., Tan, T. (2004). Regular Expressions for Languages over Infinite Alphabets. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27798-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22856-1

  • Online ISBN: 978-3-540-27798-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation