# 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 K. Salomaa},
journal={Acta Informatica},
year={2015},
volume={53},
pages={67-85}
}
• Published 2015
• Computer Science, Mathematics
• Acta Informatica
• 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·2n-1 [respectively, $$(n + \frac{1}{2}) \cdot 2^n - 2$$(n+12)·2n-2] when using complete (respectively, incomplete) deterministic finite automata. We show that the state complexity… CONTINUE READING

#### Explore Further: Topics Discussed in This Paper

State Complexity of Insertion
• Computer Science, Mathematics
• 2016
• 7
• Open Access
Site-Directed Deletion
• Computer Science
• 2018
• 1
• Open Access

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 47 REFERENCES