Detail publikace

Insertion and Deletion Operations

Originální název

Insertion and Deletion Operations

Anglický název

Insertion and Deletion Operations

Jazyk

en

Originální abstrakt

Stringology represents a modern part of the formal language theory, which deals with strings, languages and operations on them. It introduces many new language operations, which can be divided into two groups - insertion and deletion operations. This paper presents these operations and some 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.

Anglický abstrakt

Stringology represents a modern part of the formal language theory, which deals with strings, languages and operations on them. It introduces many new language operations, which can be divided into two groups - insertion and deletion operations. This paper presents these operations and some 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.

BibTex


@inproceedings{BUT16936,
  author="Martin {Vítek}",
  title="Insertion and Deletion Operations",
  annote="Stringology represents a modern part of the formal language theory, which deals with strings, languages and operations on them. It introduces many new language operations, which can be divided into two groups - insertion and deletion operations. This paper presents these operations and some 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.",
  address="Faculty of Information Technology BUT",
  booktitle="Proceedings of the 10th conference Student EEICT 2004",
  chapter="16936",
  institution="Faculty of Information Technology BUT",
  year="2004",
  month="april",
  pages="292--296",
  publisher="Faculty of Information Technology BUT",
  type="conference paper"
}