Skip to main content
SpringerLink
Log in

Nondeterministic State Complexity of Site-Directed Deletion

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13266))

Included in the following conference series:

  • 261 Accesses

Abstract

Site-directed deletion is a biologically inspired operation that removes a contiguous substring from the host string guided by a template string. The template string must match the prefix and suffix of a substring. When this occurs the middle section of the substring not contained in the prefix or suffix is removed. We consider the nondeterministic state complexity of the site-directed deletion operation. For regular languages recognized by nondeterministic finite automata with N and M states, respectively, we establish a new upper bound of \(2NM + N\) and a new worst case lower bound of 2NM. The upper bound improves a previously established upper bound, and no non-trivial lower bound was previously known for the nondeterministic state complexity of site-directed deletion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1024 (1994)

    Article  Google Scholar 

  2. Birget, J.C.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185–190 (1992)

    Article  MathSciNet  Google Scholar 

  3. Carter, P.: Site-directed mutagenesis. Biochem. J. 237(1), 1–7 (1986)

    Article  Google Scholar 

  4. Cho, D.-J., Han, Y.-S., Kim, H., Salomaa, K.: Site-directed deletion. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 219–230. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98654-8_18

    Chapter  Google Scholar 

  5. Cho, D.J., Han, Y.S., Ng, T., Salomaa, K.: Outfix-guided insertion. Theoret. Comput. Sci. 701, 70–84 (2017)

    Article  MathSciNet  Google Scholar 

  6. Cho, D.J., Han, Y.S., Salomaa, K., Smith, T.: Site-directed insertion: language equations and decision problems. Theoret. Comput. Sci. 798, 40–51 (2019)

    Article  MathSciNet  Google Scholar 

  7. Domaratzki, M.: Deletion along trajectories. Theoret. Comput. Sci. 320(2), 293–313 (2004)

    Article  MathSciNet  Google Scholar 

  8. Franco, G., Manca, V.: Algorithmic applications of XPCR. Nat. Comput. Int. J. 10(2), 15 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Han, Y.S., Ko, S.K., Ng, T., Salomaa, K.: State complexity of insertion. Int. J. Found. Comput. Sci. 27(07), 863–878 (2016)

    Article  MathSciNet  Google Scholar 

  10. Han, Y.-S., Ko, S.-K., Salomaa, K.: State complexity of deletion and bipolar deletion. Acta Informatica 53(1), 67–85 (2015). https://doi.org/10.1007/s00236-015-0245-y

    Article  MathSciNet  MATH  Google Scholar 

  11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Boston (1979)

    Google Scholar 

  12. Ito, M., Kari, L., Thierrin, G.: Insertion and deletion closure of languages. Theoret. Comput. Sci. 183(1), 3–19 (1997)

    Google Scholar 

  13. Kari, L.: On Insertion and Deletion in Formal Languages. Ph.D. thesis, University of Turku (1991)

    Google Scholar 

  14. Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Inf. Comput. 131(1), 47–61 (1996)

    Article  MathSciNet  Google Scholar 

  15. Manca, V., Franco, G.: Computing by polymerase chain reaction. Math. Biosci. 211(2), 282–298 (2008)

    Article  MathSciNet  Google Scholar 

  16. Mullis, K., Faloona, F., Scharf, S., Saiki, R., Horn, G., Erlich, H.: Specific enzymatic amplification of DNA in vitro: the polymerase chain reaction. Cold Spring Harb. Symp. Quant. Biol. 51, 263–273 (1986). https://doi.org/10.1101/sqb.1986.051.01.032

    Article  Google Scholar 

  17. Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series). Springer, Berlin (2006)

    Google Scholar 

  18. Takahara, A., Yokomori, T.: On the computational power of insertion-deletion systems. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 269–280. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36440-4_24

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, Kingston, ON, K7L 3N6, Canada

    Oliver A. S. Lyon & Kai Salomaa

Authors
  1. Oliver A. S. Lyon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Oliver A. S. Lyon or Kai Salomaa .

Editor information

Editors and Affiliations

  1. UFR. des Sciences et Techniques, University of Rouen, Saint-Étienne du Rouvray Cedex, France

    Pascal Caron

  2. UFR. des Sciences et Techniques, University of Rouen, Saint-Étienne du Rouvray Cedex, France

    Ludovic Mignot

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lyon, O.A.S., Salomaa, K. (2022). Nondeterministic State Complexity of Site-Directed Deletion. In: Caron, P., Mignot, L. (eds) Implementation and Application of Automata. CIAA 2022. Lecture Notes in Computer Science, vol 13266. Springer, Cham. https://doi.org/10.1007/978-3-031-07469-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-07469-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-07468-4

  • Online ISBN: 978-3-031-07469-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation