{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:20Z","timestamp":1725559760495},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_35","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"421-433","source":"Crossref","is-referenced-by-count":2,"title":["Groupoids That Recognize Only Regular Languages"],"prefix":"10.1007","author":[{"given":"Martin","family":"Beaudry","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Lemieux","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D. Barrington","year":"1988","unstructured":"Barrington, D., Th\u00e9rien, D.: Finite Monoids and the Fine Structure of NC 1. J. ACM\u00a035(4), 941\u2013952 (1988)","journal-title":"J. ACM"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0304-3975(97)00119-9","volume":"209","author":"M. Beaudry","year":"1998","unstructured":"Beaudry, M.: Languages recognized by finite aperiodic groupoids. TCS\u00a0209, 299\u2013317 (1998)","journal-title":"TCS"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-63165-8_169","volume-title":"Automata, Languages and Programming","author":"M. Beaudry","year":"1997","unstructured":"Beaudry, M., Lemieux, F., Th\u00e9rien, D.: Finite loops recognize exactly the regular open languages. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 110\u2013120. Springer, Heidelberg (1997)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Caussinus, H., Lemieux, F.: The complexity of computing over quasigroups. In: Proc. 14th annual FST&TCS, pp. 36\u201347 (1994)","DOI":"10.1007\/3-540-58715-2_112"},{"key":"35_CR5","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":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-44693-1_25","volume-title":"STACS 2001","author":"R. Gavald\u00e0","year":"2001","unstructured":"Gavald\u00e0, R., Th\u00e9rien, D.: Learning expressions over monoids. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 283\u2013293. Springer, Heidelberg (2001)"},{"key":"35_CR7","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"35_CR8","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representations of events in nerve nets and finite automata. In: Shannon, C.E. (ed.) Automata Studies, vol.\u00a03(41). Priceton University Press, Princeton (1956)"},{"key":"35_CR9","unstructured":"Lemieux, F.: Finite groupoids and their applications to computational complexity, Ph.D. Thesis, McGill University (May 1996)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Inform. and Contr.\u00a011, 3\u201329 (1967)","journal-title":"Inform. and Contr."},{"key":"35_CR11","doi-asserted-by":"crossref","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 Press, New York (1986)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Koucky, M., Pudlak, P., Therien, D.: Bounded-depth circuits: separating wires from gates. In: Accepted in the 37th ACM Symposium on Theory of Computing, STOC (2005)","DOI":"10.1145\/1060590.1060629"},{"key":"35_CR13","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, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02194921","volume":"13","author":"M.-P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.-P.: Sur le produit de concat\u00e9nation non ambigu. Semigroup Forum\u00a013, 45\u201375 (1976)","journal-title":"Semigroup Forum"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise Testable Events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Tesson, P., Th\u00e9rien, D.: Complete Classifications for the Communication Complexity of Regular Languages. In: Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (2003)","DOI":"10.1007\/3-540-36494-3_7"},{"key":"35_CR17","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 monoid. J. Pure and Applied Algebra\u00a048, 83\u2013198 (1987)","journal-title":"J. Pure and Applied Algebra"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:07Z","timestamp":1605643567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11523468_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}