Detail výsledku

Closure Properties of Insertion and Deletion Operations

VÍTEK, M. Closure Properties of Insertion and Deletion Operations. Proceedings of the 11th conference Student EEICT 2005. Brno: Faculty of Information Technology BUT, 2005. p. 586-590. ISBN: 80-214-2890-2.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Vítek Martin, Ing., Ph.D., FIT (FIT), UIFS (FIT)
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.

Klíčová slova
  • Stringology
  • sequential insertion
  • parallel insertion
  • scattered sequential insertion
  • sequential deletion
  • parallel deletion
  • scattered sequential deletion
  • finite automata
  • closure properties
Rok
2005
Strany
586–590
Sborník
Proceedings of the 11th conference Student EEICT 2005
Konference
STUDENT EEICT 2005
ISBN
80-214-2890-2
Vydavatel
Faculty of Information Technology BUT
Místo
Brno
BibTeX 
@inproceedings{BUT21474,
  author="Martin {Vítek}",
  title="Closure Properties of Insertion and Deletion Operations",
  booktitle="Proceedings of the 11th conference Student EEICT 2005",
  year="2005",
  pages="586--590",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  isbn="80-214-2890-2"
}
Projekty
Optimally Integrated Models of Modern Information Technologies, GAČR, Standardní projekty, GA201/04/0441, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru