{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:53Z","timestamp":1725537233210},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04027-6_27","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"364-378","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Structures of Bounded Degree Revisited"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"B\u00e1r\u00e1ny, V., Kaiser, \u0141., Rubin, S.: Cardinality and counting quantifiers on omega-automatic structures. In: STACS 2008, pp. 385\u2013396. IFIB Schloss Dagstuhl (2008)"},{"key":"27_CR2","unstructured":"Blumensath, A.: Automatic structures. Technical report, RWTH Aachen (1999)"},{"key":"27_CR3","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":"27_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","volume":"48","author":"K. Compton","year":"1990","unstructured":"Compton, K., Henson, C.: A uniform method for proving lower bounds on the computational complexity of logical theories. Ann. Pure Appl. Logic\u00a048, 1\u201379 (1990)","journal-title":"Ann. Pure Appl. Logic"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C. Elgot","year":"1961","unstructured":"Elgot, C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"27_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing In Groups","author":"D. Epstein","year":"1992","unstructured":"Epstein, D., Cannon, J., Holt, D., Levy, S., Paterson, M., Thurston, W.: Word Processing In Groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"27_CR7","unstructured":"Finkel, O.: On decidability properties of one-dimensional cellular automata. arXiv.org (2008), \n                    \n                      http:\/\/arxiv.org\/abs\/0903.4615"},{"key":"27_CR8","first-page":"105","volume-title":"Logic Colloquium 1981","author":"H. Gaifman","year":"1982","unstructured":"Gaifman, H.: On local and nonlocal properties. In: Logic Colloquium 1981, pp. 105\u2013135. North-Holland, Amsterdam (1982)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(82)90042-1","volume":"19","author":"B. Hodgson","year":"1982","unstructured":"Hodgson, B.: On direct products of automaton decidable theories. Theoret. Comput. Sci.\u00a019, 331\u2013335 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR10","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":"27_CR11","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":"27_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2178\/jsl\/1208358745","volume":"73","author":"D. Kuske","year":"2008","unstructured":"Kuske, D., Lohrey, M.: First-order and counting theories of \u03c9-automatic structures. J. Symbolic Logic\u00a073, 129\u2013150 (2008)","journal-title":"J. Symbolic Logic"},{"key":"27_CR13","unstructured":"Kuske, D., Lohrey, M.: Automatic structures of bounded degree revisited. arXiv.org (2008), \n                    \n                      http:\/\/arxiv.org\/abs\/0810.4998"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","first-page":"344","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Lohrey","year":"2003","unstructured":"Lohrey, M.: Automatic structures of bounded degree. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 344\u2013358. Springer, Heidelberg (2003)"},{"key":"27_CR15","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. Bull. Symbolic Logic\u00a014, 169\u2013209 (2008)","journal-title":"Bull. Symbolic Logic"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/3-540-45061-0_56","volume-title":"Automata, Languages and Programming","author":"T. Rybina","year":"2003","unstructured":"Rybina, T., Voronkov, A.: Upper bounds for a theory of queues. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 714\u2013724. Springer, Heidelberg (2003)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/BF00264285","volume":"27","author":"A. Weber","year":"1990","unstructured":"Weber, A.: On the valuedness of finite transducers. Acta Inform.\u00a027, 749\u2013780 (1990)","journal-title":"Acta Inform."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T13:43:09Z","timestamp":1548423789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}