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 |
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
Han, Y. S., Ko, S. K., & Salomaa, K. (2016). State complexity of deletion and bipolar deletion. Acta Informatica, 53(1), 67-85. https://doi.org/10.1007/s00236-015-0245-y