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

State Complexity
Formal languages
Deletion
Regular Languages
Finite automata
Deterministic Finite Automata
Arbitrary
Lower bound
Upper bound
Language

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
Han, Yo-Sub ; Ko, Sang Ki ; Salomaa, Kai. / State complexity of deletion. Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings. Springer Verlag, 2014. pp. 37-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{eb92d4246df54c8b957da01c5468ed1e,
title = "State complexity of deletion",
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.",
author = "Yo-Sub Han and Ko, {Sang Ki} and Kai Salomaa",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-09698-8_4",
language = "English",
isbn = "9783319096971",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "37--48",
booktitle = "Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings",
address = "Germany",

}

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

State complexity of deletion. / Han, Yo-Sub; Ko, Sang Ki; Salomaa, Kai.

Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings. Springer Verlag, 2014. p. 37-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8633 LNCS).

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

TY - GEN

T1 - State complexity of deletion

AU - Han, Yo-Sub

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958538333&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958538333&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-09698-8_4

DO - 10.1007/978-3-319-09698-8_4

M3 - Conference contribution

SN - 9783319096971

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 37

EP - 48

BT - Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings

PB - Springer Verlag

ER -

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