{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:45Z","timestamp":1759638765806},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_16","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"204-217","source":"Crossref","is-referenced-by-count":2,"title":["Semiautomatic Structures"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyuan","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-30870-3_11","volume-title":"How the World Computes","author":"J. Case","year":"2012","unstructured":"Case, J., Jain, S., Seah, S., Stephan, F.: Automatic Functions, Linear Time and Learning. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol.\u00a07318, pp. 96\u2013106. Springer, Heidelberg (2012)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. Comptes Rendus Mathematique\u00a0339(1), 5\u201310 (2004)","journal-title":"Comptes Rendus Mathematique"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"D.B.A. Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"16_CR4","unstructured":"Fuchs, L.: Partially Ordered Algebraic Systems. Pergamon Press (1963)"},{"issue":"1","key":"16_CR5","first-page":"39","volume":"7","author":"B.R. Hodgson","year":"1983","unstructured":"Hodgson, B.R.: D\u00e9cidabilit\u00e9 par automate fini. Annales des Sciences Math\u00e9matiques du Qu\u00e9bec\u00a07(1), 39\u201357 (1983)","journal-title":"Annales des Sciences Math\u00e9matiques du Qu\u00e9bec"},{"key":"16_CR6","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 3rd edn. Addison-Wesley (2007)"},{"key":"16_CR7","unstructured":"Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. CoRR abs\/1107.3645 (2011)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-24749-4_39","volume-title":"STACS 2004","author":"B. Khoussainov","year":"2004","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Definability and Regularity in Automatic Structures. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 440\u2013451. Springer, Heidelberg (2004)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-28332-1_34","volume-title":"Language and Automata Theory and Applications","author":"A. Miasnikov","year":"2012","unstructured":"Miasnikov, A., \u0160uni\u0107, Z.: Cayley graph automatic groups are not necessarily Cayley graph biautomatic. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 401\u2013407. Springer, Heidelberg (2012)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2372087","volume":"71","author":"B.H. Neumann","year":"1949","unstructured":"Neumann, B.H.: On ordered groups. American Journal of Mathematics\u00a071, 1\u201318 (1949)","journal-title":"American Journal of Mathematics"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2178\/bsl\/1186666149","volume":"13","author":"A. Nies","year":"2007","unstructured":"Nies, A.: Describing Groups. The Bulletin of Symbolic Logic\u00a013(3), 305\u2013339 (2007)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.jalgebra.2007.04.015","volume":"320","author":"A. Nies","year":"2008","unstructured":"Nies, A., Thomas, R.: FA-presentable groups and rings. Journal of Algebra\u00a0320, 569\u2013585 (2008)","journal-title":"Journal of Algebra"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.2178\/jsl\/1318338853","volume":"76","author":"T. Tsankov","year":"2011","unstructured":"Tsankov, T.: The additive group of the rationals does not have an automatic presentation. The Journal of Symbolic Logic\u00a076(4), 1341\u20131351 (2011)","journal-title":"The Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:53:30Z","timestamp":1558914810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}