{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:07Z","timestamp":1776316987605,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601784","type":"print"},{"value":"9783540447207","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60178-3_93","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:49:21Z","timestamp":1330278561000},"page":"367-392","source":"Crossref","is-referenced-by-count":137,"title":["Automatic presentations of structures"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[]},{"given":"Anil","family":"Nerode","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","unstructured":"Aspects of Effective Algebra, Proceedings of a Conference at Monash University, 1979, edited by J.N. Crossley."},{"key":"18_CR2","unstructured":"C.J. Ash, A. Nerode, Intrinsically Recursive Relations, Aspects of Effective Algebra, Proceeding of a Conference at Monash University, Australia, 1979."},{"key":"18_CR3","unstructured":"R. Buchi, The Monadic Theory of \u03c91, in: Decidable Theories II, Lecture Notes in Mathematics, 328, 1\u2013127."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"R. Buchi, D. Siefkes, Axiomatization of the Monadic second Order Theory of \u03c91, in: Decidable Theories II, Lect. Not. in Mathematics, 328, 127\u2013215.","DOI":"10.1007\/BFb0082721"},{"key":"18_CR5","volume-title":"Automata, Languages, and Mashines, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages, and Mashines, vol. A, Academic Press, New York, 1974."},{"key":"18_CR6","unstructured":"D.Epstein, J.Cannon, and others, Word Processing in Groups, Jones and Bartlett Publishers, Boston, London."},{"key":"18_CR7","unstructured":"Yu.L. Ershov, Problems of Decidability and Constructive Models, Moscow, 1989."},{"key":"18_CR8","first-page":"432","volume":"248","author":"A. Frohlich","year":"1955","unstructured":"A.Frohlich, J. Shepherdson, Effective Procedures in Field Theory, Philos. Tranns. Roy. Soc, London, ser A 248, 1955, 432\u2013487.","journal-title":"Philos. Tranns. Roy. Soc, London, ser A"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"S.S. Goncharov, The Problem of the Number Of Non-Self-Equivalent Constructivizations, Algebra and Logic, No 6, 1980.","DOI":"10.1007\/BF01669323"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and L. Harrington, Trees, Automata and Games, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, 60\u201365.","DOI":"10.1145\/800070.802177"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"A.I. Mal'cev A.I, Constructive Algebras, Uspekhi Matem. Nauk, 16, No 3, 1961.","DOI":"10.1070\/RM1961v016n03ABEH001120"},{"key":"18_CR12","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"M. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees, Trans. of American Math. Soc., 141, 1969, 1\u201335.","journal-title":"Trans. of American Math. Soc."},{"key":"18_CR13","first-page":"1","volume-title":"Mathematical Logic and Foundations of Set Theory","author":"M. Rabin","year":"1970","unstructured":"M.Rabin, Weakly Definable Relations and Special Automata, Mathematical Logic and Foundations of Set Theory, North-Holland, Amsterdam, 1970, 1\u201323."},{"key":"18_CR14","first-page":"341","volume":"95","author":"M. Rabin","year":"1960","unstructured":"M. Rabin, Computable Algebra: General theory and Theory of Computable Fields, Trans. Amer. Math. Soc., 95, 1960, 341\u2013360","journal-title":"Trans. Amer. Math. Soc."},{"key":"18_CR15","unstructured":"J.B. Remmel, D. Cenzer, Polynomial Time Versus Recursive Models, Annals of Pure and Applied Logic, 1991."},{"key":"18_CR16","unstructured":"J.B. Remmel, D. Cenzer, Feasibly Categorical Abelian Groups, Proceedings of the Workshop Feasible Mathematics II, to appear."},{"key":"18_CR17","unstructured":"H. Rogers, Theory of Recursive Function and Effective Computability, New York, 1967."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on Infinite Objects, in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen editor, The MIT Press\/Elsevier, 1990, 133\u2013192.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"C. Frougny, J. Sakarovitch, Synchronized Ratinal Relations of Finite and Infinite Words, Theoretical Computer Science, 108, 1993, 45\u201382.","journal-title":"Theoretical Computer Science"},{"key":"18_CR20","unstructured":"B.Khoussainov, A. Nerode, Automatic Models and S2S, in preparation."}],"container-title":["Lecture Notes in Computer Science","Logic and Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60178-3_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:32:47Z","timestamp":1619573567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60178-3_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601784","9783540447207"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60178-3_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}