{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:09Z","timestamp":1725544749390},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_28","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"274-285","source":"Crossref","is-referenced-by-count":0,"title":["${\\mathcal C}$ -Varieties, Actions and Wreath Product"],"prefix":"10.1007","author":[{"given":"Laura","family":"Chaubard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J.A. Brzozowski","year":"1973","unstructured":"Brzozowski, J.A., Simon, I.: Characterizations of locally testable events. Discrete Math.\u00a04, 243\u2013271 (1973)","journal-title":"Discrete Math."},{"key":"28_CR2","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol.\u00a0B. Academic Press, London (1976)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45005-X_4","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z.: Extended temporal logic on finite words and wreath products of monoids with distinguished generators. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 43\u201358. Springer, Heidelberg (2003)"},{"key":"28_CR4","first-page":"1","volume":"16","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Ito, M.: Temporal logic with cyclic counting and the degree of aperiodicity of finite automata. Acta Cybernetica\u00a016, 1\u201328 (2003)","journal-title":"Acta Cybernetica"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1051\/ita:2003017","volume":"37","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Larsen, K.G.: Regular languages defined by Lindstr\u00f6m quantifiers. Theoret. Informatics Appl.\u00a037, 179\u2013242 (2003)","journal-title":"Theoret. Informatics Appl."},{"key":"28_CR6","first-page":"132","volume-title":"Theory of Models","author":"W. Hanf","year":"1965","unstructured":"Hanf, W.: Model-theoretic methods in the study of elementary logic. In: Theory of Models, pp. 132\u2013145. North-Holland, Amsterdam (1965)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1051\/ita:2003018","volume":"37","author":"M. Kunc","year":"2003","unstructured":"Kunc, M.: Equational description of pseudovarieties of homomorphisms. Theoret. Informatics Appl.\u00a037, 243\u2013254 (2003)","journal-title":"Theoret. Informatics Appl."},{"issue":"5","key":"28_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0020-0190(97)00133-6","volume":"63","author":"D. Peled","year":"1997","unstructured":"Peled, D., Wilke, T.: Stutter-invariant temporal properties are expressible without the next-time operator. Inf. Process. Lett.\u00a063(5), 243\u2013246 (1997)","journal-title":"Inf. Process. Lett."},{"key":"28_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of formal languages","author":"J.-\u00c9. Pin","year":"1986","unstructured":"Pin, J.-\u00c9.: Varieties of formal languages. North Oxford, London (1986)"},{"key":"28_CR10","volume-title":"Handbook of formal languages, ch. 10","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, ch. 10, vol.\u00a01. Springer, Heidelberg (1997)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1051\/ita:2005014","volume":"39","author":"J.-\u00c9. Pin","year":"2005","unstructured":"Pin, J.-\u00c9., Straubing, H.: Some results on C-varieties. Theoret. Informatics Appl.\u00a039, 239\u2013262 (2005)","journal-title":"Theoret. Informatics Appl."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"5677","DOI":"10.1081\/AGB-120016005","volume":"30","author":"J.-\u00c9. Pin","year":"2002","unstructured":"Pin, J.-\u00c9., Weil, P.: The wreath product principle for ordered semigroups. Communications in Algebra\u00a030, 5677\u20135713 (2002)","journal-title":"Communications in Algebra"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02483902","volume":"14","author":"J. Reiterman","year":"1982","unstructured":"Reiterman, J.: The Birkhoff theorem for finite algebras. Alg. Univ.\u00a014(1), 1\u201310 (1982)","journal-title":"Alg. Univ."},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0022-4049(79)90024-0","volume":"15","author":"H. Straubing","year":"1979","unstructured":"Straubing, H.: Families of recognizable sets corresponding to certain varieties of finite monoids. J. Pure Appl. Algebra\u00a015(3), 305\u2013318 (1979)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H. Straubing","year":"1985","unstructured":"Straubing, H.: Finite semigroup varieties of the form V*D. J. Pure Appl. Algebra\u00a036(1), 53\u201394 (1985)","journal-title":"J. Pure Appl. Algebra"},{"key":"28_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite automata, formal logic, and circuit complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite automata, formal logic, and circuit complexity. Birkh\u00e4user Boston Inc., Basel (1994)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/3-540-45995-2_46","volume-title":"LATIN 2002: Theoretical Informatics","author":"H. Straubing","year":"2002","unstructured":"Straubing, H.: On logical descriptions of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 528\u2013538. Springer, Heidelberg (2002)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D., Weiss, A.: Graph congruences and wreath products. J. Pure Appl. Algebra\u00a036 (1985)","DOI":"10.1016\/0022-4049(85)90071-4"},{"issue":"1-2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0022-4049(87)90108-3","volume":"48","author":"B. Tilson","year":"1987","unstructured":"Tilson, B.: Categories as algebra: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra\u00a048(1-2), 83\u2013198 (1987)","journal-title":"J. Pure Appl. Algebra"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:33Z","timestamp":1555445913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11682462_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}