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}
}
  • Yo-Sub Han, Sang-Ki Ko, K. Salomaa
  • 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
    State Complexity of Insertion
    • 7
    • Open Access
    A General Approach to State Complexity of Operations: Formalization and Limitations
    • 6
    • Highly Influenced
    • Open Access
    Further Closure Properties of Input-Driven Pushdown Automata
    • 1
    Further closure properties of input-driven pushdown automata
    Site-Directed Deletion
    • 1
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 47 REFERENCES
    The State Complexities of Some Basic Operations on Regular Languages
    • 340
    • Open Access
    Descriptional and computational complexity of finite automata - A survey
    • 122
    • Open Access
    On the state complexity of reversals of regular languages
    • 104
    • Open Access
    On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
    • 175
    State complexity of power
    • 47
    • Open Access
    A Second Course in Formal Languages and Automata Theory
    • 191
    • Open Access
    Tight Lower Bound for the State Complexity of Shuffle of Regular Languages
    • 74
    State Complexity of Insertion
    • 7
    • Open Access
    A Review on State Complexity of Individual Operations
    • 17
    • Open Access
    Shuffle on Trajectories: Syntactic Constraints
    • 109
    • Open Access