{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:53Z","timestamp":1725544613875},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_23","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"289-300","source":"Crossref","is-referenced-by-count":5,"title":["Invariants of Automatic Presentations and Semi-synchronous Transductions"],"prefix":"10.1007","author":[{"given":"Vince","family":"B\u00e1r\u00e1ny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences, Theory, Applications, Generalizations","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences, Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.2307\/2275643","volume":"62","author":"A. B\u00e8s","year":"1997","unstructured":"B\u00e8s, A.: Undecidable extensions of B\u00fcchi arithmetic and Cobham-Sem\u00ebnov theorem. J. Symb. Log.\u00a062(4), 1280\u20131296 (1997)","journal-title":"J. Symb. Log."},{"key":"23_CR4","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH-Aachen (1999)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic Structures. In: Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS 2000, pp. 51\u201362 (2000)","DOI":"10.1109\/LICS.2000.855755"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems\u00a037, 641\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc.\u00a01, 191\u2013238 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"key":"23_CR8","volume-title":"Word processing in groups","author":"J.W. Cannon","year":"1992","unstructured":"Cannon, J.W., Epstein, D.B.A., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word processing in groups. Jones and Barlett Publ., Boston (1992)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Research and Development\u00a09, 47\u201368 (1965)","journal-title":"IBM J. Research and Development"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C.. Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theor. Comput. Sci.\u00a0108, 45\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0168-0072(89)90070-5","volume":"43","author":"L. Hella","year":"1989","unstructured":"Hella, L.: Definability hierarchies of generalized quantifiers. Ann. Pure Appl. Logic\u00a043, 235\u2013271 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"23_CR12","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. TCS\u00a019, 331\u2013335 (1982)","journal-title":"TCS"},{"key":"23_CR13","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":"23_CR14","first-page":"44","volume-title":"LICS","author":"B. Khoussainov","year":"2004","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. In: LICS, pp. 44\u201353. IEEE Computer Society, Los Alamitos (2004)"},{"issue":"2","key":"23_CR15","first-page":"287","volume":"8","author":"B. Khoussainov","year":"2003","unstructured":"Khoussainov, B., Rubin, S.: Automatic structures: Overview and future directions. Journal of Automata, Languages and Combinatorics\u00a08(2), 287\u2013301 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"23_CR16","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":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-39813-4_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Is cantor\u2019s theorem automatic? In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 332\u2013345. Springer, Heidelberg (2003)"},{"key":"23_CR18","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.2307\/2695073","volume":"65","author":"M. Otto","year":"2000","unstructured":"Otto, M.: Epsilon-logic is more expressive than first-order logic over finite structures. J. Symb. Logic\u00a065, 1749\u20131757 (2000)","journal-title":"J. Symb. Logic"},{"key":"23_CR20","unstructured":"Rubin, S.: Automatic structures. Ph.D. thesis, University of Auckland, NZ (2004)"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T23:17:33Z","timestamp":1586733453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11672142_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}