{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:51:18Z","timestamp":1725587478416},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214929"},{"type":"electronic","value":"9783642214936"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_6","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T12:42:44Z","timestamp":1308573764000},"page":"97-114","source":"Crossref","is-referenced-by-count":4,"title":["Typed Monoids \u2013 An Eilenberg-Like Theorem for Non Regular Languages"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Behle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Krebs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephanie","family":"Reifferscheid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0168-0072(89)90036-5","volume":"45","author":"M. Ajtai","year":"1989","unstructured":"Ajtai, M.: First-order definability on finite structures. Ann. Pure Appl. Logic\u00a045(3), 211\u2013225 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1142\/2481","volume-title":"Finite Semigroups and Universal Algebra","author":"J. Almeida","year":"1995","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1995)"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/0022-0000(92)90014-A","volume":"44","author":"D.A.M. Barrington","year":"1992","unstructured":"Barrington, D.A.M., Compton, K.J., Straubing, H., Th\u00e9rien, D.: Regular languages in NC1. J. Comput. Syst. Sci.\u00a044(3), 478\u2013499 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On Uniformity within NC1. J. Comput. Syst. Sci.\u00a041(3), 274\u2013306 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Straubing, H., Th\u00e9rien, D.: Non-uniform automata over groups. Inf. Comput.\u00a089(2), 109\u2013132 (1990)","journal-title":"Inf. Comput."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-74456-6_15","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C. Behle","year":"2007","unstructured":"Behle, C., Krebs, A., Mercer, M.: Linear circuits, two-variable logic and weakly blocked monoids. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 147\u2013158. Springer, Heidelberg (2007)"},{"key":"6_CR7","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A+B. Academic Press, London (1976)"},{"issue":"3","key":"6_CR8","first-page":"179","volume":"37","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Larsen, K.G.: Regular languages definable by Lindstr\u00f6m quantifiers. ITA\u00a037(3), 179\u2013241 (2003)","journal-title":"ITA"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. In: FOCS, pp. 260\u2013270 (1981)","DOI":"10.1109\/SFCS.1981.35"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","volume":"61","author":"Y. Gurevich","year":"1984","unstructured":"Gurevich, Y., Lewis, H.R.: A logic for constant-depth circuits. Information and Control\u00a061(1), 65\u201374 (1984)","journal-title":"Information and Control"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput.\u00a016(4), 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"key":"6_CR12","unstructured":"Krebs, A.: Typed Semigroups, Majority Logic, and Threshold Circuits. Ph.D. thesis, Universit\u00e4t T\u00fcbingen (2008)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00224-006-1310-2","volume":"40","author":"A. Krebs","year":"2007","unstructured":"Krebs, A., Lange, K.J., Reifferscheid, S.: Characterizing TC0 in terms of infinite groups. Theory Comput. Syst.\u00a040(4), 303\u2013325 (2007)","journal-title":"Theory Comput. Syst."},{"key":"6_CR14","series-title":"Research Monograph","first-page":"163","volume-title":"Counter-free automata. With an appendix by William Henneman","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free automata. With an appendix by William Henneman. Research Monograph, vol.\u00a065, XIX, 163 p. The M.I.T. Press, Cambridge (1971)"},{"key":"6_CR15","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":"Pin, J.E.: Varieties of formal languages. Plenum, London (1986)"},{"key":"6_CR16","first-page":"80","volume":"39","author":"J.E. Pin","year":"1995","unstructured":"Pin, J.E.: A variety theorem without complementation. Izvestiya VUZ Matematika\u00a039, 80\u201390 (1995); english version: Russian Mathem. (Iz. VUZ) 39, 74\u201383 (1995)","journal-title":"Izvestiya VUZ Matematika"},{"issue":"1","key":"6_CR17","first-page":"239","volume":"39","author":"J.E. Pin","year":"2005","unstructured":"Pin, J.E., Straubing, H.: Some results on C-varieties. ITA\u00a039(1), 239\u2013262 (2005)","journal-title":"ITA"},{"issue":"1","key":"6_CR18","first-page":"1","volume":"29","author":"J. Rhodes","year":"1995","unstructured":"Rhodes, J., Weil, P.: Algebraic and topological theory of languages. ITA\u00a029(1), 1\u201344 (1995)","journal-title":"ITA"},{"key":"6_CR19","first-page":"27","volume":"62","author":"J.L. Rhodes","year":"1989","unstructured":"Rhodes, J.L., Tilson, B.: The kernel of monoid morphisms. J. Pure Applied Alg.\u00a062, 27\u2013268 (1989)","journal-title":"J. Pure Applied Alg."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-07854-1_222","volume-title":"Mathematical Foundations of Computer Science 1976","author":"J. Sakarovitch","year":"1976","unstructured":"Sakarovitch, J.: An algebraic framework for the study of the syntactic monoids application to the group languages. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol.\u00a045, pp. 510\u2013516. Springer, Heidelberg (1976)"},{"issue":"2","key":"6_CR21","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":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control\u00a08(2), 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"6_CR22","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 (1994)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Tesson, P., Th\u00e9rien, D.: Logic meets algebra: the case of regular languages. Logical Methods in Computer Science 3(1) (2007)","DOI":"10.2168\/LMCS-3(1:4)2007"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T07:08:33Z","timestamp":1553843313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}