{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T10:47:14Z","timestamp":1749034034609,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_24","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"394-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Number of Languages with Maximum State Complexity"],"prefix":"10.1007","author":[{"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"first","affiliation":[]},{"given":"Lei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"issue":"5","key":"24_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1941487.1941511","volume":"54","author":"S Arora","year":"2011","unstructured":"Arora, S., Barak, B., Brunnermeier, M., Ge, R.: Computational complexity and information asymmetry in financial products. Commun. ACM 54(5), 101\u2013107 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ejor.2010.09.020","volume":"210","author":"S Bolus","year":"2011","unstructured":"Bolus, S.: Power indices of simple games and vector-weighted majority games by means of binary decision diagrams. Eur. J. Oper. Res. 210(2), 258\u2013272 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"24_CR3","first-page":"189","volume":"9","author":"C C\u00e2mpeanu","year":"2004","unstructured":"C\u00e2mpeanu, C., Ho, W.H.: The maximum state complexity for finite languages. J. Autom. Lang. Comb. 9(2\u20133), 189\u2013202 (2004)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(89)90037-1","volume":"23","author":"J-M Champarnaud","year":"1989","unstructured":"Champarnaud, J.-M., Pin, J.-E.: A maxmin problem on finite automata. Discrete Appl. Math. 23(1), 91\u201396 (1989)","journal-title":"Discrete Appl. Math."},{"key":"24_CR5","series-title":"Addison-Wesley Series in Computer Science","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 Series in Computer Science. Addison-Wesley Publishing Co., Reading (1979)"},{"issue":"4","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1007\/s00224-017-9795-4","volume":"61","author":"B Kjos-Hanssen","year":"2017","unstructured":"Kjos-Hanssen, B.: On the complexity of automatic complexity. Theory Comput. Syst. 61(4), 1427\u20131439 (2017)","journal-title":"Theory Comput. Syst."},{"key":"24_CR7","series-title":"Combinatorial Algorithms, Part 1","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, Part 1, vol. 4A. Addison-Wesley, Upper Saddle River (2011)"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00182-012-0327-9","volume":"42","author":"S Kurz","year":"2013","unstructured":"Kurz, S., Tautenhahn, N.: On Dedekind\u2019s problem for complete simple games. Int. J. Game Theory 42(2), 411\u2013437 (2013)","journal-title":"Int. J. Game Theory"},{"key":"24_CR9","volume-title":"An Introduction to Formal Language and Automata","author":"P Linz","year":"2006","unstructured":"Linz, P.: An Introduction to Formal Language and Automata. Jones and Bartlett Publishers Inc., Burlington (2006)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9, 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"key":"24_CR11","series-title":"Springer Finance Textbooks","volume-title":"Stochastic Calculus for Finance I: The Binomial Asset Pricing Model","author":"SE Shreve","year":"2004","unstructured":"Shreve, S.E.: Stochastic Calculus for Finance I: The Binomial Asset Pricing Model. Springer Finance Textbooks. Springer, New York (2004)"},{"doi-asserted-by":"crossref","unstructured":"Sloane, N.J.A.: The online encyclopedia of integer sequences (2018). Sequence A000372","key":"24_CR12","DOI":"10.1090\/noti1734"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:09:53Z","timestamp":1709824193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}