Advertisement

Insertion and deletion of words: Determinism and reversibility

  • Lila Kari
Conference paper
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Sequential Insertion Reverse Implication Formal Language Theory Basic Combinatorics Deletion Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andraşiu, M., Dassow, J., Paun, Gh., Salomaa, A.: Language-theoretical problems arising from Richelieu cryptosystems (to appear)Google Scholar
  2. 2.
    Kari, L.: On insertion and deletion in formal languages. Ph.D. Thesis University of Turku (1991)Google Scholar
  3. 3.
    Lyndon, R.C., Schutzenberger, M.P.: The equation a M = bNcP in a free group. Michigan Math.J. 9(1962) 289–298zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Paun, Gh., Salomaa, A.: Semi-commutativity sets — a cryptographically grounded topic. Bull.Math.Soc.Sci.Math.Roumanie (to appear)Google Scholar
  5. 5.
    Salomaa, A.: Public-key Cryptography. Springer Verlag Berlin (1990)zbMATHGoogle Scholar
  6. 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–73Google Scholar
  7. 7.
    Shyr, H.J.: Free Monoids and Languages. Lecture Notes, Institute of applied mathematics, National Chung-Hsing University Taichung Taiwan (1991)Google Scholar
  8. 8.
    Shyr, H.J., Thierrin, G., Yu, S.S.: Monogenic e-closed languages and dipolar words (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Lila Kari
    • 1
  1. 1.Academy of Finland and Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations