{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:10:42Z","timestamp":1749787842056,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319500614"},{"type":"electronic","value":"9783319500621"}],"license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50062-1_24","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T10:09:42Z","timestamp":1480500582000},"page":"394-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Injection Structures Specified by Finite State Transducers"],"prefix":"10.1007","author":[{"given":"Sam","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas","family":"Cenzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mia","family":"Minnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Remmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"24_CR2","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"C Ash","year":"2000","unstructured":"Ash, C., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)"},{"key":"24_CR3","unstructured":"Blumensath, A.: Automatic structures. Diploma Thesis, RWTH Aachen (1999)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proceedings of the 15th LICS, pp. 51\u201362 (2000)","DOI":"10.1109\/LICS.2000.855755"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-21875-0_6","volume-title":"Models of Computation in Context","author":"D Cenzer","year":"2011","unstructured":"Cenzer, D., Harizanov, V., Remmel, J.B.: Effective categoricity of injection structures. In: L\u00f6we, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 51\u201360. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21875-0_6"},{"key":"24_CR6","unstructured":"Cenzer, D., Harizanov, V., Remmel, J.B.: Computability-theoretic properties of injection structures. In: Algebra and Logic (to appear)"},{"key":"24_CR7","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. C.R. Acad\u00e8mie des sciences Paris, Ser. I 339, 5\u201310 (2004)","journal-title":"C.R. Acad\u00e8mie des sciences Paris, Ser. I"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(82)90042-1","volume":"19","author":"BR Hodgson","year":"1982","unstructured":"Hodgson, B.R.: On direct products of automaton decidable theories. Theoret. Comput. Sci. 19, 331\u2013335 (1982). North-Holland","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR9","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. 960, pp. 367\u2013392. Springer, Heidelberg (1995). doi:10.1007\/3-540-60178-3_93"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Shore, R.A.: Effective model theory: the number of models and their complexity. In: Cooper, S.B., Truss, J.K. (eds.) Models and Computability, Invited Papers from LC 1997, LMSLNS vol. 259, pp. 193\u2013240, Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9780511565670.009"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders. In: Proceedings of the 18th LICS, pp. 168\u2013177 (2003)","DOI":"10.1109\/LICS.2003.1210056"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. In: Proceedings of the 19th LICS, pp. 44\u201353 (2004)","DOI":"10.1109\/LICS.2004.1319599"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/1094622.1094625","volume":"6","author":"B Khoussainov","year":"2005","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Trans. Comput. Logic 6(4), 675\u2013700 (2005)","journal-title":"ACM Trans. Comput. Logic"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-79228-4_47","volume-title":"Theory and Applications of Models of Computation","author":"B Khoussainov","year":"2008","unstructured":"Khoussainov, B., Liu, J., Minnes, M.: Unary automatic graphs: an algorithmic perspective. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 542\u2013553. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-79228-4_47"},{"key":"24_CR15","unstructured":"Rubin, S.: Automatic structures. Ph.D. Thesis, University of Auckland (2004)"},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50062-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T23:05:55Z","timestamp":1749769555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50062-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,1]]},"ISBN":["9783319500614","9783319500621"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50062-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,1]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}