{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:24:40Z","timestamp":1742923480640,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411132"},{"type":"electronic","value":"9783319411149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41114-9_11","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T10:05:14Z","timestamp":1467021914000},"page":"138-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Descriptional Complexity of Bounded Regular Languages"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Herrmann","sequence":"first","affiliation":[]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"JC Birget","year":"1992","unstructured":"Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"issue":"35","key":"11_CR2","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1016\/j.tcs.2009.05.019","volume":"410","author":"H Bordihn","year":"2009","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35), 3209\u20133222 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47(2), 149\u2013158 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/S0304-3975(03)00136-1","volume":"302","author":"M Chrobak","year":"2003","unstructured":"Chrobak, M.: Errata to \u201cFinite automata and unary languages\u201d. Theoret. Comput. Sci. 302, 497\u2013498 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032640","volume-title":"Introduction to Combinatorics","author":"MJ Erickson","year":"1996","unstructured":"Erickson, M.J.: Introduction to Combinatorics. Wiley, New York (1996)"},{"key":"11_CR6","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. CoRR abs\/1509.03254 (2015). \n                    http:\/\/arxiv.org\/abs\/1509.03254"},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1090\/S0002-9939-1966-0201310-3","volume":"17","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded regular sets. Proc. Amer. Math. Soc. 17(5), 1043\u20131049 (1966)","journal-title":"Proc. Amer. Math. Soc."},{"key":"11_CR8","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw Hill, New York (1966)"},{"key":"11_CR9","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. 59, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"11_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ic.2015.11.007","volume":"246","author":"OH Ibarra","year":"2016","unstructured":"Ibarra, O.H., Ravikumar, B.: On bounded languages and reversal-bounded automata. Inf. Comput. 246, 30\u201342 (2016)","journal-title":"Inf. Comput."},{"issue":"6","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1142\/S0129054112400539","volume":"23","author":"OH Ibarra","year":"2012","unstructured":"Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. Int. J. Found. Comput. Sci. 23(6), 1291\u20131306 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: Succinct representation of regular languages by Boolean automata. Theoret. Comput. Sci. 13, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2013.03.008","volume":"227","author":"A Malcher","year":"2013","unstructured":"Malcher, A., Pighizzini, G.: Descriptional complexity of bounded context-free languages. Inf. Comput. 227, 1\u201320 (2013)","journal-title":"Inf. Comput."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT 1971, pp. 188\u2013191. IEEE (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S012905410200100X","volume":"13","author":"G Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal\u2019s function. Int. J. Found. Comput. Sci. 13, 145\u2013159 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR18","first-page":"177","volume":"2","author":"K Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. J. Autom. Lang. Comb. 2, 177\u2013186 (1997)","journal-title":"J. Autom. Lang. Comb."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321864.321865","volume":"22","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM 22, 1\u201310 (1975)","journal-title":"J. ACM"},{"key":"11_CR20","first-page":"221","volume":"6","author":"S Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"11_CR21","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. Theoret. Comput. Sci. 125(2), 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41114-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:03:03Z","timestamp":1594598583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41114-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411132","9783319411149"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41114-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}