{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:05Z","timestamp":1725890345422},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_13","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T01:03:34Z","timestamp":1341795814000},"page":"169-182","source":"Crossref","is-referenced-by-count":4,"title":["State Complexity of Chop Operations on Unary and Finite Languages"],"prefix":"10.1007","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Jakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Babu, S.A., Pandya, P.K.: Chop expressions and discrete duration calculus. In: Modern Applications of Automata Theory. IISc research Monographs Series, vol.\u00a02. World Scientific (2010)"},{"key":"13_CR2","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. Inform. Process. Lett.\u00a043, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik II, K., Salomaa, K., Yu, S.: State Complexity of Basic Operations on Finite Languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"key":"13_CR4","first-page":"713","volume":"26","author":"A. C\u0103r\u0103u\u015fu","year":"1981","unstructured":"C\u0103r\u0103u\u015fu, A., P\u0103un, G.: String intersection and short concatenation. Rev. Roumaine Math. Pures Appl.\u00a026, 713\u2013726 (1981)","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/j.ic.2009.02.009","volume":"270","author":"M. Domaratzki","year":"2009","unstructured":"Domaratzki, M.: Minimality in Template-Guided Recombination. Inform. Comput.\u00a0270, 1209\u20131220 (2009)","journal-title":"Inform. Comput."},{"key":"13_CR6","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. Inform. Process. Lett.\u00a059, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"13_CR7","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)"},{"key":"13_CR8","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: The chop of languages. In: Automata and Formal Languages (AFL), Debrecen, Hungary, pp. 197\u2013210 (2011)"},{"issue":"6","key":"13_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. Internat. J. Found. Comput. Sci.\u00a014(6), 1087\u20131102 (2003)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/malq.200610030","volume":"53","author":"M. Ito","year":"2007","unstructured":"Ito, M., Lischke, G.: Generalized periodicity and primitivity. Math. Logic Q.\u00a053, 91\u2013106 (2007)","journal-title":"Math. Logic Q."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by Boolean automata. Theoret. Comput. Sci.\u00a013, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR12","first-page":"1373","volume":"11","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Dokl.\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"13_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"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev.\u00a03, 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"13_CR15","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 complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"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_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:40:34Z","timestamp":1620114034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}