{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:37Z","timestamp":1725484657104},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_13","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"91-104","source":"Crossref","is-referenced-by-count":10,"title":["Weakly Iterated Block Products of Finite Monoids"],"prefix":"10.1007","author":[{"given":"Howard","family":"Straubing","sequence":"first","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"13_CR1","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976."},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J. E. Pin","year":"1986","unstructured":"J. E. Pin, Varieties of Formal Languages, Plenum, London, 1986."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0022-4049(89)90137-0","volume":"62","author":"J. Rhodes","year":"1989","unstructured":"J. Rhodes and B. Tilson, \u201cThe Kernel of Monoid Morphisms\u201d, J. Pure and Applied Algebra\n 62 (1989) 227\u2013268.","journal-title":"J. Pure and Applied Algebra"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M. P. Sch\u00fctzenberger","year":"1965","unstructured":"M. P. Sch\u00fctzenberger, \u201cOn finite monoids having only trivial subgroups\u201d, Information and Control\n 8 (1965) 190\u2013194.","journal-title":"Information and Control"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0019-9958(61)80006-5","volume":"4","author":"M. P. Sch\u00fctzenberger","year":"1961","unstructured":"M. P. Sch\u00fctzenberger, \u201cA remark on finite transducers\u201d, Information and Control\n 4 (1961), 185\u2013196.","journal-title":"Information and Control"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02194921","volume":"13","author":"M. P. Sch\u00fctzenberger","year":"1976","unstructured":"M. P. Sch\u00fctzenberger, \u201cSur le Produit de Concatenation Non-ambigu\u201d, Semigroup Forum\n 13 (1976), 47\u201376.","journal-title":"Semigroup Forum"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0001-8708(73)90007-8","volume":"11","author":"P. Stiffler","year":"1973","unstructured":"P. Stiffler, \u201cExtensions of the Fundamental Theorem of Finite Semigroups\u201d, Advances in Mathematics, 11 159\u2013209 (1973).","journal-title":"Advances in Mathematics"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"H. Straubing and D. Th\u00e9rien, \u201cRegular languages defined by generalized first-order formulas with a bounded number of bound variables\u201d, Proc. 18th Symposium on Theoretical Aspects of Computer Science 551\u2013562 (2001).","DOI":"10.1007\/3-540-44693-1_48"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-1-4612-0289-9_2","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"Howard Straubing","year":"1994","unstructured":"H. Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkh\u00e4user, Boston, 1994."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-4049(91)90119-M","volume":"74","author":"D. Th\u00e9rien","year":"1991","unstructured":"D. Th\u00e9rien, \u201cTwo-sided wreath products of categories\u201d, J. Pure and Applied Algebra\n 74 (1991) 307\u2013315.","journal-title":"J. Pure and Applied Algebra"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"D. Th\u00e9rien and T. Wilke, \u201cOver Words, Two Variables are as Powerful as One Quantifier Alternation,\u201d Proc. 30th ACM Symposium on the Theory of Computing 256\u2013263 (1998).","DOI":"10.1145\/276698.276749"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:18:42Z","timestamp":1550362722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}