{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:58:57Z","timestamp":1725890337716},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_7","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:03:34Z","timestamp":1341810214000},"page":"89-102","source":"Crossref","is-referenced-by-count":0,"title":["On Inverse Operations and Their Descriptional Complexity"],"prefix":"10.1007","author":[{"given":"Maria Paola","family":"Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Jakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"7_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"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1145\/321406.321409","volume":"14","author":"J.A. Brzozowski","year":"1967","unstructured":"Brzozowski, J.A.: Roots of star events. Journal of the ACM\u00a014(3), 466\u2013477 (1967)","journal-title":"Journal of the ACM"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-12200-2_20","volume-title":"LATIN 2010: Theoretical Informatics","author":"J..A. Brzozowski","year":"2010","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Li, B.: Quotient Complexity of Ideal Languages. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 208\u2013221. Springer, Heidelberg (2010)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I. Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters\u00a059(2), 75\u201377 (1996)","journal-title":"Information Processing Letters"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2007.07.036","volume":"387","author":"H. Gruber","year":"2007","unstructured":"Gruber, H., Holzer, M., Kutrib, M.: The size of Higman-Haines sets. Theoretical Computer Science\u00a0387(2), 167\u2013176 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/FI-2009-0035","volume":"91","author":"H. Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M., Kutrib, M.: More on the size of Higman-Haines sets: Effective construction. Fundamenta Informaticae\u00a091(1), 105\u2013121 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"L.H. Haines","year":"1969","unstructured":"Haines, L.H.: On free monoids partially ordered by embedding. Journal of Combinatorial Theory\u00a06, 94\u201398 (1969)","journal-title":"Journal of Combinatorial Theory"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-22321-1_23","volume-title":"Developments in Language Theory","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Jakobi, S.: Chop Operations and Expressions: Descriptional Complexity Considerations. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 264\u2013275. Springer, Heidelberg (2011)"},{"issue":"6","key":"7_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":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-00982-2_3","volume-title":"Language and Automata Theory and Applications","author":"M. Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M.: Descriptional and Computational Complexity of Finite Automata. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 23\u201342. Springer, Heidelberg (2009)"},{"key":"7_CR11","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1051\/ita:2007038","volume":"42","author":"G. Jir\u00e1skova","year":"2008","unstructured":"Jir\u00e1skova, G., Okhotin, A.: State complexity of cyclic shift. RAIRO\u2013Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications\u00a042(2), 335\u2013360 (2008)","journal-title":"RAIRO\u2013Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"7_CR13","first-page":"71","volume":"45","author":"A. Mateescu","year":"1996","unstructured":"Mateescu, A., Salomaa, A.: Parallel composition of words with re-entrant symbols. Analele Universit\u01ce\u0163ii Bucure\u015fti Matematic\u01ce-Informatic\u01ce\u00a045, 71\u201380 (1996)","journal-title":"Analele Universit\u01ce\u0163ii Bucure\u015fti Matematic\u01ce-Informatic\u01ce"},{"issue":"3","key":"7_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.3233\/FI-2010-252","volume":"99","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A.: On the state complexity of scattered substrings and superstrings. Fundamenta Informaticae\u00a099(3), 325\u2013338 (2010)","journal-title":"Fundamenta Informaticae"},{"issue":"7","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1142\/S0129054111008957","volume":"22","author":"E.V. Pribavkina","year":"2011","unstructured":"Pribavkina, E.V., Rodaro, E.: State complexity of code operators. International Journal of Foundations of Computer Science\u00a022(7), 1669\u20131681 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"9","key":"7_CR16","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ipl.2011.01.018","volume":"111","author":"N. Rampersad","year":"2011","unstructured":"Rampersad, N., Shallit, J., Wang, M.W.: Inverse star, border, and palstars. Information Processing Letters\u00a0111(9), 420\u2013422 (2011)","journal-title":"Information Processing Letters"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"7_CR18","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. Journal of Automata, Languages and Combinatorics\u00a06, 221\u2013234 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"7_CR19","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, 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-642-31623-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:41Z","timestamp":1620128441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}