Skip to main content
SpringerLink
Log in

Connecting Partial Words and Regular Languages

  • Conference paper
Book cover How the World Computes (CiE 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7318))

Included in the following conference series:

Abstract

We initiate a study of languages of partial words related to regular languages of full words. First, we study the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words with a finite set of letters. Results regarding the structure, uniqueness and succinctness of such a representation, as well as a series of related decidability and computational-hardness results, are presented. Finally, we define a hierarchy of classes of languages of partial words, by grouping together languages that can be connected in strong ways to regular languages, and derive their closure properties.

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. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press (2008)

    Google Scholar 

  3. Fischer, M.J., Paterson, M.S.: String matching and other products. In: Complexity of Computation, Proceedings of SIAM-AMS, vol. 7, pp. 113–125 (1974)

    Google Scholar 

  4. Lischke, G.: Restoration of punctured languages and similarity of languages. Mathematical Logic Quarterly 52(1), 20–28 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Manea, F., Mercaş, R.: Freeness of partial words. Theoretical Computer Science 389(1-2), 265–277 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Manea, F., Tiseanu, C.: Hard Counting Problems for Partial Words. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 426–438. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer-Verlag New York, Inc., Secaucus (1997)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Postfach 4120, 39016, Magdeburg, Germany

    Jürgen Dassow & Robert Mercaş

  2. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 24098, Kiel, Germany

    Florin Manea

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Mercaş
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. Computer Laboratory, University of Cambridge, Willialm Gates Building, J.J. Thomson Avenue, CB3 0FD, Cambridge, UK

    Anuj Dawar

  3. Institute for Logic, Language and Computation, University of Amsterdam, 1090 GE, Amsterdam, The Netherlands

    Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J., Manea, F., Mercaş, R. (2012). Connecting Partial Words and Regular Languages. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30870-3_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30869-7

  • Online ISBN: 978-3-642-30870-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation