Insertion and deletion of words: Determinism and reversibility
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.
KeywordsSequential Insertion Reverse Implication Formal Language Theory Basic Combinatorics Deletion Operation
Unable to display preview. Download preview PDF.
- 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
- 4.Paun, Gh., Salomaa, A.: Semi-commutativity sets — a cryptographically grounded topic. Bull.Math.Soc.Sci.Math.Roumanie (to appear)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–73Google 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