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 language | English |
|---|---|
| Pages (from-to) | 67-85 |
| Number of pages | 19 |
| Journal | Acta Informatica |
| Volume | 53 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2016 Feb 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Computer Networks and Communications
Cite this
}
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 journal › Article
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 -