{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T10:51:45Z","timestamp":1794480705360,"version":"4.9.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319097039","type":"print"},{"value":"9783319097046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_10","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T05:43:21Z","timestamp":1405057401000},"page":"102-113","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity of Inversion Operations"],"prefix":"10.1007","author":[{"given":"Da-Jung","family":"Cho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sang-Ki","family":"Ko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J.-C. Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Information Processing Letters\u00a043(4), 185\u2013190 (1992)","journal-title":"Information Processing Letters"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.06.009","volume":"483","author":"D. Cantone","year":"2013","unstructured":"Cantone, D., Cristofaro, S., Faro, S.: Efficient string-matching allowing for non-overlapping inversions. Theoretical Computer Science\u00a0483, 85\u201395 (2013)","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","unstructured":"Cho, D.-J., Han, Y.-S., Kang, S.-D., Kim, H., Ko, S.-K., Salomaa, K.: Pseudo-inversion on formal languages. In: Proceeding of the 13th International Conference on Unconventional and Natural Computation (to appear)"},{"issue":"1-3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M. Daley","year":"2003","unstructured":"Daley, M., Ibarra, O.H., Kari, L.: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theoretical Computer Science\u00a0306(1-3), 19\u201338 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"10_CR5","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0304-3975(01)00096-2","volume":"270","author":"J. Dassow","year":"2002","unstructured":"Dassow, J., Mitrana, V.: Operations and language generating devices suggested by the genome evolution. Theoretical Computer Science\u00a0270(12), 701\u2013738 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0303-2647(97)00036-1","volume":"43","author":"J. Dassow","year":"1997","unstructured":"Dassow, J., Mitrana, V., Salomaa, A.: Context-free evolutionary grammars and the structural language of nucleic acids. Biosystems\u00a043(3), 169\u2013177 (1997)","journal-title":"Biosystems"},{"issue":"35","key":"10_CR7","doi-asserted-by":"publisher","first-page":"3272","DOI":"10.1016\/j.tcs.2009.03.026","volume":"410","author":"Z. \u00c9sik","year":"2009","unstructured":"\u00c9sik, Z., Gao, Y., Liu, G., Yu, S.: Estimation of state complexity of combined operations. Theoretical Computer Science\u00a0410(35), 3272\u20133280 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"10_CR8","first-page":"75","volume":"83","author":"Y. Gao","year":"2008","unstructured":"Gao, Y., Salomaa, K., Yu, S.: The state complexity of two combined operations: Star of catenation and star of reversal. Fundamenta Informaticae\u00a083(1-2), 75\u201389 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"6","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. International Journal of Foundations of Computer Science\u00a014(6), 1087\u20131102 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata \u2013 a survey. Information and Computation\u00a0209, 456\u2013470 (2011)","journal-title":"Information and Computation"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0029799","volume-title":"Combinatorial Pattern Matching","author":"J.D. Kececioglu","year":"1993","unstructured":"Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two chromosomes. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 87\u2013105. Springer, Heidelberg (1993)"},{"key":"10_CR12","first-page":"70","volume":"111","author":"M. Kutrib","year":"2013","unstructured":"Kutrib, M., Pighizzini, G.: Recent trends in descriptional complexity of formal languages. Bulletin of the EATCS\u00a0111, 70\u201386 (2013)","journal-title":"Bulletin of the EATCS"},{"key":"10_CR13","first-page":"328","volume":"9","author":"O. Lupanov","year":"1963","unstructured":"Lupanov, O.: A comparison of two types of finite sources. Problemy Kibernetiki\u00a09, 328\u2013335 (1963)","journal-title":"Problemy Kibernetiki"},{"issue":"10","key":"10_CR14","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0168-9525(98)01555-8","volume":"14","author":"J.R. Lupski","year":"1998","unstructured":"Lupski, J.R.: Genomic disorders: structural features of the genome can lead to DNA rearrangements and human disease traits. Trends in Genetics\u00a014(10), 417\u2013422 (1998)","journal-title":"Trends in Genetics"},{"key":"10_CR15","first-page":"1373","volume":"11","author":"A. Maslov","year":"1970","unstructured":"Maslov, A.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Mathematics Doklady"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, A., Fisher, M.: Economy of description by automata, grammars and formal systems. In: Proceedings of the 12th Annual Symposium on Switching and Automata Theory, pp. 188\u2013191 (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","volume":"C-20","author":"F. Moore","year":"1971","unstructured":"Moore, F.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic and two-way finite automata. IEEE Transactions on Computers\u00a0C-20, 1211\u20131214 (1971)","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1126\/science.78.2034.585","volume":"78","author":"T.S. Painter","year":"1933","unstructured":"Painter, T.S.: A New Method for the Study of Chromosome Rearrangements and the Plotting of Chromosome Maps. Science\u00a078, 585\u2013586 (1933)","journal-title":"Science"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Beyond Words, vol.\u00a03. Springer-Verlag New York, Inc. (1997)","DOI":"10.1007\/978-3-642-59126-6"},{"issue":"2-3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"A. Salomaa","year":"2007","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoretical Computer Science\u00a0383(2-3), 140\u2013152 (2007)","journal-title":"Theoretical Computer Science"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1142\/S0129054107004917","volume":"18","author":"K. Salomaa","year":"2007","unstructured":"Salomaa, K., Yu, S.: On the state complexity of combined operations and their estimation. International Journal of Foundations of Computer Science\u00a018, 683\u2013698 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10_CR22","unstructured":"Searls, D.B.: The Computational Linguistics of Biological Sequences. In: Artificial Intelligence and Molecular Biology, pp. 47\u2013120 (1993)"},{"key":"10_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J. Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory, 1st edn. Cambridge University Press, New York (2008)","edition":"1"},{"key":"10_CR24","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11851561_18","volume-title":"Algorithms in Bioinformatics","author":"A.F. Vellozo","year":"2006","unstructured":"Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in O(n 3)-time. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 186\u2013196. Springer, Heidelberg (2006)"},{"key":"10_CR25","unstructured":"Wood, D.: Theory of Computation. Harper & Row (1986)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Yokomori, T., Kobayashi, S.: DNA evolutionary linguistics and RNA structure modeling: A computational approach. In: Proceedings of INBS 1995, pp. 38\u201345. IEEE Computer Society (1995)","DOI":"10.1109\/INBS.1995.404281"},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoretical Computer Science\u00a0125(2), 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09704-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T15:32:35Z","timestamp":1746286355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}