Publication detail

Insertion and Deletion Operations

VÍTEK, M.

Original Title

Insertion and Deletion Operations

English Title

Insertion and Deletion Operations

Type

conference paper

Language

en

Original Abstract

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.

English abstract

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.

Keywords

  • stringology
  • sequential insertion
  • parallel insertion
  • scattered sequential insertion
  • sequential deletion
  • parallel deletion
  • scattered sequential deletion
  • finite automata
  • closure properties

Released

29.04.2004

Publisher

Faculty of Information Technology BUT

Location

Brno

ISBN

80-214-2635-7

Book

Proceedings of the 10th conference Student EEICT 2004

Pages from

292

Pages to

296

Pages count

5

Documents

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"
}