Stringology represents a modern part of the formal language theory which deal with strings, languages and operations on them. It introduces many new languages operations, which can be divided into two groups - insertion and deletion operations. Some of these operations are described in [1] . This paper presents these operations and some of their properties. Especially, closure properties are studied here. New algorithms that construct finite automata accepting languages resulting from some of these operations are described here. We actually demonstrate by designing these algorithms, that the family of regular languages is closed under these operations.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.