Insertion and deletion of words: Determinism and reversibility [chapter]

Lila Kari
1992 Lecture Notes in Computer Science  
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.
doi:10.1007/3-540-55808-x_30 fatcat:qftpxik5ebfgboxuteeoifniem