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

Fingerprint

Formal languages
Finite automata

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Networks and Communications

Cite this

Han, Yo-Sub ; Ko, Sang Ki ; Salomaa, Kai. / State complexity of deletion and bipolar deletion. In: Acta Informatica. 2016 ; Vol. 53, No. 1. pp. 67-85.
@article{f03d8c4f10154807866b731db313cc7a,
title = "State complexity of deletion and bipolar 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 (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.",
author = "Yo-Sub Han and Ko, {Sang Ki} and Kai Salomaa",
year = "2016",
month = "2",
day = "1",
doi = "10.1007/s00236-015-0245-y",
language = "English",
volume = "53",
pages = "67--85",
journal = "Acta Informatica",
issn = "0001-5903",
publisher = "Springer New York",
number = "1",

}

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

In: Acta Informatica, Vol. 53, No. 1, 01.02.2016, p. 67-85.

Research output: Contribution to journalArticle

TY - JOUR

T1 - State complexity of deletion and bipolar deletion

AU - Han, Yo-Sub

AU - Ko, Sang Ki

AU - Salomaa, Kai

PY - 2016/2/1

Y1 - 2016/2/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 (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.

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

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

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

U2 - 10.1007/s00236-015-0245-y

DO - 10.1007/s00236-015-0245-y

M3 - Article

AN - SCOPUS:84958167092

VL - 53

SP - 67

EP - 85

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

IS - 1

ER -