Abstract
The state complexity of a regular language \(L_m\) is the number m of states in a minimal deterministic finite automaton (DFA) accepting \(L_m\). The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities \(\le m\) and \(\le n\), respectively. We find a tight upper bound on the state complexity of the binary operation overlap assembly on regular languages. This operation was introduced by Csuhaj-Varjú, Petre, and Vaszil to model the process of self-assembly of two linear DNA strands into a longer DNA strand, provided that their ends “overlap”. We prove that the state complexity of the overlap assembly of languages \(L_m\) and \(L_n\), where \(m\ge 2\) and \(n\ge 1\), is at most \(2 (m-1) 3^{n-1} + 2^n\). Moreover, for \(m \ge 2\) and \(n \ge 3\) there exist languages \(L_m\) and \(L_n\) over an alphabet of size n whose overlap assembly meets the upper bound and this bound cannot be met with smaller alphabets.
This work was supported by the Natural Sciences and Engineering Research Council of Canada under grants No. OGP0000871 and R2824A01, and by the National Science Centre, Poland, under project number 2014/15/B/ST6/00615.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Brzozowski, J.A.: Towards a theory of complexity of regular languages. J. Autom. Lang. Comb. 23(1–3), 67–101 (2018). http://arxiv.org/abs/1702.05024
Brzozowski, J.A., Kari, L., Li, B., Szykuła, M.: State Complexity of Overlap Assembly (2017). http://arxiv.org/abs/1710.06000
Carausu, A., Paun, G.: String intersection and short concatenation. Rev. Roumaine Math. Pures Appl. 26, 713–726 (1981)
Csuhaj-Varjú, E., Petre, I., Vaszil, G.: Self-assembly of strings and languages. Theoret. Comput. Sci. 374(1–3), 74–81 (2007)
Domaratzki, M.: Minimality in template-guided recombination. Inf. Comput. 207(11), 1209–1220 (2009)
Enaganti, S.K., Ibarra, O.H., Kari, L., Kopecki, S.: On the overlap assembly of strings and languages. Nat. Comput. 16(1), 175–185 (2016)
Enaganti, S.K., Ibarra, O.H., Kari, L., Kopecki, S.: Further remarks on DNA overlap assembly. Inform. Comput. 253, 143–154 (2017)
Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Comb. 21(4), 251–310 (2016)
Golan, J.S.: The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science. Addison-Wesley Longman Ltd., Essex (1992)
Holzer, M., Jakobi, S., Kutrib, M.: The chop of languages. Theoret. Comput. Sci. 682, 122–137 (2017)
Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 57–69. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48017-X_6
Ito, M., Lischke, G.: Generalized periodicity and primitivity for words. Math. Logic Q. 53(1), 91–106 (2007)
Kari, L., Kitto, R., Thierrin, G.: Codes, involutions, and DNA encodings. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 376–393. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45711-9_21
Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266–1268 (1970). (in Russian) English translation: Soviet Math. Dokl. 11, 1373–1375 (1970)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315–328 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Brzozowski, J.A., Kari, L., Li, B., Szykuła, M. (2018). State Complexity of Overlap Assembly. In: Câmpeanu, C. (eds) Implementation and Application of Automata. CIAA 2018. Lecture Notes in Computer Science(), vol 10977. Springer, Cham. https://doi.org/10.1007/978-3-319-94812-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-94812-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94811-9
Online ISBN: 978-3-319-94812-6
eBook Packages: Computer ScienceComputer Science (R0)