State complexity of deletion and bipolar deletion

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 (Formula presented.) [respectively, (Formula presented.) ] when using complete (respectively, incomplete) deterministic finite automata. We show that the state complexity of bipolar deletion has an upper bound (Formula presented.) [respectively (Formula presented.) ] when using complete (respectively, incomplete) deterministic finite automata. In both cases we give almost matching lower bounds.

Original languageEnglish
Pages (from-to)67-85
Number of pages19
JournalActa Informatica
Volume53
Issue number1
DOIs
Publication statusPublished - 2016 Feb 1

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'State complexity of deletion and bipolar deletion'. Together they form a unique fingerprint.

  • Cite this