{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:08:26Z","timestamp":1743001706385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_11","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"143-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complexity Analysis: Transformation Monoids of Finite Automata"],"prefix":"10.1007","author":[{"given":"Christian","family":"Brandl","sequence":"first","affiliation":[]},{"given":"Hans Ulrich","family":"Simon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"11_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","volume":"88","author":"S Cho","year":"1991","unstructured":"Cho, S., Huynh, D.T.: Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88(1), 99\u2013116 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-21254-3_1","volume-title":"Language and Automata Theory and Applications","author":"T Colcombet","year":"2011","unstructured":"Colcombet, T.: Green\u2019s relations and their use in automata theory. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 1\u201321. Springer, Heidelberg (2011)"},{"key":"11_CR4","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)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 254\u2013266. IEEE Computer Society, Washington (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"11_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"JE Pin","year":"1986","unstructured":"Pin, J.E.: Varieties of Formal Languages. Plenum Publishing, New York (1986)"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On Finite Monoids Having Only Trivial Subgroups. Information and Control 8(2), 190\u2013194 (1965)","journal-title":"Information and Control"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J Stern","year":"1985","unstructured":"Stern, J.: Complexity of Some Problems from the Theory of Automata. Information and Control 66(3), 163\u2013176 (1985)","journal-title":"Information and Control"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00224-004-1190-2","volume":"38","author":"P Tesson","year":"2005","unstructured":"Tesson, P., Th\u00e9rien, D.: Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38(2), 135\u2013159 (2005)","journal-title":"Theory Comput. Syst."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing. In: 11th Annual Symposium on Theory of Computing, pp. 209\u2013213. ACM, New York (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:11:56Z","timestamp":1676466716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}