{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:24:56Z","timestamp":1725600296759},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_39","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"424-435","source":"Crossref","is-referenced-by-count":0,"title":["Size and Computation of Injective Tree Automatic Presentations"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Weidner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Blumensath, A.: Automatic structures. Diplomarbeit, RWTH Aachen (1999)"},{"key":"39_CR2","first-page":"51","volume-title":"LICS 2000","author":"A. Blumensath","year":"2000","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic Structures. In: LICS 2000, pp. 51\u201362. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Colcombet, T., L\u00f6ding, C.: Transforming structures by set interpretations. Logical Methods in Computer Science\u00a03(2) (2007)","DOI":"10.2168\/LMCS-3(2:4)2007"},{"key":"39_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications, \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\n                    \n                    \n                   (release October 12, 2007),"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(82)90042-1","volume":"19","author":"B.R. Hodgson","year":"1982","unstructured":"Hodgson, B.R.: On direct products of automaton decidable theories. Theor. Comput. Sci.\u00a019, 331\u2013335 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR6","unstructured":"Kartzow, A.: Collapsible pushdown graphs of level 2 are tree-automatic. In: STACS 2010, Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a05, pp. 501\u2013512. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2010)"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"39_CR8","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. Logical Methods in Computer Science\u00a03(2) (2007)","DOI":"10.2168\/LMCS-3(2:2)2007"},{"key":"39_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)"},{"issue":"4","key":"39_CR10","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. Log.\u00a06(4), 675\u2013700 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"39_CR11","unstructured":"Kuske, D., Lohrey, M.: Automatic structures of bounded degree revisited. To appear in Journal of Symbolic Logic in slightly extended form (2008), \n                    \n                      http:\/\/arxiv.org\/abs\/0810.4998"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"678","DOI":"10.2178\/jsl\/1268917499","volume":"75","author":"D. Kuske","year":"2010","unstructured":"Kuske, D., Lohrey, M.: Some natural problems in automatic graphs. J. Symbolic Logic\u00a075(2), 678\u2013710 (2010)","journal-title":"J. Symbolic Logic"},{"key":"39_CR13","first-page":"160","volume-title":"LICS 2010","author":"D. Kuske","year":"2010","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures. In: LICS 2010, pp. 160\u2013169. IEEE Computer Society, Los Alamitos (2010)"},{"key":"39_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-89439-1_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A.W. To","year":"2008","unstructured":"To, A.W., Libkin, L.: Recurrent Reachability Analysis in Regular Model Checking. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 198\u2013213. Springer, Heidelberg (2008)"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-12032-9_16","volume-title":"Foundations of Software Science and Computational Structures","author":"A.W. To","year":"2010","unstructured":"To, A.W., Libkin, L.: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 221\u2013236. Springer, Heidelberg (2010)"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2178\/bsl\/1208442827","volume":"14","author":"S. Rubin","year":"2008","unstructured":"Rubin, S.: Automata presenting structures: A survey of the finite string case. Bulletin of Symbolic Logic\u00a014, 169\u2013209 (2008)","journal-title":"Bulletin of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:40:27Z","timestamp":1620042027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}