Skip to main content
SpringerLink
Log in

Insertion and deletion of words: Determinism and reversibility

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1992 (MFCS 1992)

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

Abstract

The paper addresses two problems belonging to the basic combinatorics of words. They are connected with the operations of sequential insertion and deletion, which are nondeterministic versions of catenation and right/left quotient. Necessary and sufficient conditions, under which the result of sequential insertion or deletion of two words is a singleton set, are given. Also the situation when the insertion and deletion are inverse to each other, which is not generally the case, is studied.

The work reported here is a part of the project 11281 of the Academy of Finland

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andraşiu, M., Dassow, J., Paun, Gh., Salomaa, A.: Language-theoretical problems arising from Richelieu cryptosystems (to appear)

    Google Scholar 

  2. Kari, L.: On insertion and deletion in formal languages. Ph.D. Thesis University of Turku (1991)

    Google Scholar 

  3. Lyndon, R.C., Schutzenberger, M.P.: The equation a M = bNcP in a free group. Michigan Math.J. 9(1962) 289–298

    Article  MATH  MathSciNet  Google Scholar 

  4. Paun, Gh., Salomaa, A.: Semi-commutativity sets — a cryptographically grounded topic. Bull.Math.Soc.Sci.Math.Roumanie (to appear)

    Google Scholar 

  5. Salomaa, A.: Public-key Cryptography. Springer Verlag Berlin (1990)

    MATH  Google Scholar 

  6. Sântean, L.: Six arithmetic-like operations on languages. Revue Roumaine de Linguistique Tome XXXIII (1988), Cahiers de linguistique theorique et applique Tome XXV (1988) 1 Janvier-Juin 65–73

    Google Scholar 

  7. Shyr, H.J.: Free Monoids and Languages. Lecture Notes, Institute of applied mathematics, National Chung-Hsing University Taichung Taiwan (1991)

    Google Scholar 

  8. Shyr, H.J., Thierrin, G., Yu, S.S.: Monogenic e-closed languages and dipolar words (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academy of Finland and Department of Mathematics, University of Turku, 20500, Turku, Finland

    Lila Kari

Authors
  1. Lila Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kari, L. (1992). Insertion and deletion of words: Determinism and reversibility. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55808-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation