In this paper we consider an operation of inserting contexts in a word controlled by a contextual scheme X which provides a selection criterion for contextual insertion. We say that a language L is k-stable w.r.t. a contextual scheme X if by making any k context insertions in a word of L we still obtain a word of L; L is k-anti-stable w.r.t. X if by making any k context insertions in a word of L we get a word not in L; L is called k-error-correctable w.r.t. X if by making any k context insertions in a word x of L we get either a word in L or a word not in L which cannot be also obtained by making k context insertions in a word z of L different from x. We prove that all these properties are decidable for regular languages. We then define a distance between two words that measures the minimal number of context insertions in one of the words in order to obtain the other. Some properties of this distance, which is actually a semimetric, are investigated.
KeywordsRegular Language Plain Text Empty Word Input Word Formal Language Theory
Unable to display preview. Download preview PDF.
- 1.Dieffenbach, C.W., Dveksler, G.S. (eds.): A Laboratory Manual. Cold Spring Harbor Laboratory Press (1995)Google Scholar
- 3.Karlin, S., Mocarski, E.S., Schachtel, G.A.: Molecular Evolution of Herpesviruses: Genomic and Protein Comparisons. J. of Virology 68, 1886–1902 (1994)Google Scholar
- 4.van Lindt, J.H.: Introduction to Coding Theory. Springer, Berlin (1982)Google Scholar
- 8.McGeoch, D.J.: Molecular Evolution of Large DNA Viruses of Eukaryotes. Seminars in Virology 3, 399–408 (1992)Google Scholar
- 9.Mitrana, V.: Contextual Insertion and Deletion. In: Păun, G. (ed.) Mathematical Linguistics and Related Topics, pp. 271–278. The Publishing House of the Romanian Academy (1994)Google Scholar
- 10.Oflezer, K.: Error-Tolerant Finite State Recognition. In: Proceedings of the Fourth International Workshop on Parsing Technologies, Prague, pp. 196–207 (September 20-24, 1995)Google Scholar