{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:01Z","timestamp":1725662881408},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108542"},{"type":"electronic","value":"9783540387657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10854-8_40","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:31:12Z","timestamp":1330191072000},"page":"360-372","source":"Crossref","is-referenced-by-count":3,"title":["Some algebraic aspects of recognizability and rationality"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Steinby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,28]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"BERSTEL, J., Transductions and context-free languages. \u2014 B. G. Teubner, Stuttart (1979)."},{"key":"40_CR2","volume-title":"Universal algebra","author":"P.M. Cohn","year":"1965","unstructured":"COHN, P.M., Universal algebra. \u2014 Harper&Row, New York (1965)."},{"key":"40_CR3","volume-title":"Automata, languages, and machines. Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"EILENBERG, S., Automata, languages, and machines. Vol. A. \u2014 Academic Press, New York (1974)."},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","volume":"11","author":"S. Eilenberg","year":"1967","unstructured":"EILENBERG, S. and J.B. WRIGHT, Automata in general algebras. \u2014 Information and Control 11 (1967), 452\u2013470.","journal-title":"Information and Control"},{"key":"40_CR5","unstructured":"G\u00c9CSEG, F. and M. STEINBY, The theory of tree automata. \u2014 Submitted for publication (1981)."},{"key":"40_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal algebra, 2. ed.","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"GR\u00c4TZER, G., Universal algebra, 2. ed., \u2014 Springer Verlag, New York (1979)."},{"issue":"8","key":"40_CR7","first-page":"57","volume":"10","author":"P. Lescanne","year":"1976","unstructured":"LESCANNE, P., \u00c9quivalence entre la famille des ensembles alg\u00e9briques. \u2014 RAIRO Inform. Th\u00e9or. S\u00e9r. Rouge 10 (1976), no. 8, 57\u201381.","journal-title":"RAIRO Inform. Th\u00e9or. S\u00e9r. Rouge"},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"MEZEI, J. and J.B. WRIGHT, Algebraic automata and context-free sets. \u2014 Information and Control 11 (1967), 3\u201329.","journal-title":"Information and Control"},{"key":"40_CR9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"RABIN, M.O. and D. SCOTT, Finite automata and their decision problems. \u2014 IBM J. Res. Develop. 3 (1959), 114\u2013125.","journal-title":"IBM J. Res. Develop."},{"key":"40_CR10","first-page":"444","volume":"I","author":"M. Steinby","year":"1969","unstructured":"STEINBY, M., On definite automata and related systems. \u2014 Ann. Acad. Sc. Fenn., Ser. A I, 444 (1969).","journal-title":"Ann. Acad. Sc. Fenn."},{"key":"40_CR11","unstructured":"STEINBY, M., Syntactic algebras and varieties of recognizable sets. \u2014 Les Arbres en Algebre et en Programmation, Proc. 4\u00e9me Coll. de Lille, Lille (1979), 226\u2013240."},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"THATCHER, J.W. and J.B. WRIGHT, Generalized finite automata theory with an application to a decision problem of second order logic. \u2014 Math. Systems Theory 2 (1968), 57\u201381.","journal-title":"Math. Systems Theory"},{"key":"40_CR13","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-08353-7_175","volume":"53","author":"V. Trnkov\u00e1","year":"1977","unstructured":"TRNKOV\u00c1, V. and J. AD\u00c1MEK, On languages, accepted by machines in the category of sets. \u2014 Math. Found. Comput. Sci., Proc. 6th Symp., Tatransk\u00e1 Lomnica 1977, Lect. Notes Comput. Sci 53 (1977), 523\u2013531.","journal-title":"Math. Found. Comput. Sci., Proc. 6th Symp., Tatransk\u00e1 Lomnica 1977, Lect. Notes Comput. Sci"},{"key":"40_CR14","unstructured":"TRNKOV\u00c1, V. and J. AD\u00c1MEK, Tree-group automata. \u2014 Fundamentals of computation theory '79, Proc. Conf., Berlin\/Wendisch-Rietz 1979, (1979), 462\u2013468."},{"key":"40_CR15","volume-title":"Einf\u00fchrung in die allgemeine Algebra","author":"H. Werner","year":"1978","unstructured":"WERNER, H., Einf\u00fchrung in die allgemeine Algebra. \u2014 Bibliographisches Institut, Mannheim (1978)."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10854-8_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:37:47Z","timestamp":1687282667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10854-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108542","9783540387657"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-10854-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}