# State complexity of deletion and bipolar deletion

@article{Han2015StateCO,
title={State complexity of deletion and bipolar deletion},
author={Yo-Sub Han and Sang-Ki Ko and Kai Salomaa},
journal={Acta Informatica},
year={2015},
volume={53},
pages={67-85}
}
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 \cdot 2^{n-1}$$ n · 2 n - 1 [respectively, $$(n + \frac{1}{2}) \cdot 2^n - 2$$ ( n + 1 2 ) · 2 n - 2 ] when using complete (respectively, incomplete) deterministic finite automata. We show that the… CONTINUE READING

2 Citations
38 References
Similar Papers

#### Citations

##### Publications citing this paper.
Showing 1-2 of 2 extracted citations
Highly Influenced
7 Excerpts

#### References

##### Publications referenced by this paper.
Showing 1-10 of 38 references
Highly Influential
7 Excerpts

## Regular languages

• S. Yu
• Rozenberg, G., Salomaa, A. (eds.) Handbook of…
• 1997
Highly Influential
5 Excerpts
1 Excerpt

## State Complexity of Insertion (manuscript in preparation

• Y. Gao, X. Piao
• 2014
1 Excerpt

## State complexity ofinversion operations

• Cho, D.-J., +4 authors K. Salomaa
• Proceedings of the DCFS 2014. Lecture Notes in…
• 2014
1 Excerpt
1 Excerpt

## State complexity of combined oeprations for suffix-free regular languages

• Eom, H.-S., Han, Y.-S.
• Theor. Comput. Sci. 510, 87–93
• 2013
1 Excerpt

#### Similar Papers

Loading similar papers…