State complexity of deletion

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is well known that the language obtained by deleting an arbitrary language from a regular language is regular. We give an upper bound for the state complexity of deleting an arbitrary language from a regular language and a matching lower bound. We show that the state complexity of deletion is n ·2 n-1 (respectively,) when using complete (respectively, incomplete) deterministic finite automata.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 18th International Conference, DLT 2014, Proceedings
PublisherSpringer Verlag
Pages37-48
Number of pages12
ISBN (Print)9783319096971
DOIs
Publication statusPublished - 2014 Jan 1
Event18th International Conference on Developments in Language Theory, DLT 2014 - Ekaterinburg, Russian Federation
Duration: 2014 Aug 262014 Aug 29

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8633 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Conference on Developments in Language Theory, DLT 2014
CountryRussian Federation
CityEkaterinburg
Period14/8/2614/8/29

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., Ko, S. K., & Salomaa, K. (2014). State complexity of deletion. In Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings (pp. 37-48). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8633 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-09698-8_4