{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:11:10Z","timestamp":1773234670938,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642009815","type":"print"},{"value":"9783642009822","type":"electronic"}],"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-00982-2_44","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T15:51:54Z","timestamp":1238428314000},"page":"518-529","source":"Crossref","is-referenced-by-count":2,"title":["Analysing Complexity in Classes of Unary Automatic Structures"],"prefix":"10.1007","author":[{"given":"Jiamou","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mia","family":"Minnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"EATCS","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. EATCS. Springer, Heidelberg (2004)"},{"key":"44_CR2","first-page":"332","volume-title":"Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986)","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986), pp. 332\u2013344. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30570-5_1","volume-title":"Database Theory - ICDT 2005","author":"M. Vardi","year":"2004","unstructured":"Vardi, M.: Model checking for database theoreticians. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 1\u201316. Springer, Heidelberg (2004)"},{"key":"44_CR4","first-page":"44","volume-title":"Proc. 19th LICS","author":"B. Khoussainov","year":"2004","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. In: Proc. 19th LICS, pp. 44\u201353. IEEE Computer Society, Los Alamitos (2004)"},{"key":"44_CR5","unstructured":"Rubin, S.: Automatic Structures. PhD thesis, University of Auckland (2004)"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","first-page":"130","volume-title":"Proc. 5th DLT","author":"G. Olver","year":"2002","unstructured":"Olver, G., Thomas, R.: Automatic presentation for finitely generated groups. In: Proc. 5th DLT. LNCS, pp. 130\u2013144. Springer, Heidelberg (2002)"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s11202-005-0005-2","volume":"46","author":"N. Vinokurov","year":"2005","unstructured":"Vinokurov, N.: Complexity of some natural problems in automatic structures. Siberian Mathematical Journal\u00a046, 56\u201361 (2005)","journal-title":"Siberian Mathematical Journal"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","first-page":"520","volume-title":"Theory and Applications of Models of Computation","author":"B. Khoussainov","year":"2008","unstructured":"Khoussainov, B., Minnes, M.: Model theoretic complexity of automatic structures (Extended abstract). In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 520\u2013531. Springer, Heidelberg (2008)"},{"key":"44_CR9","first-page":"51","volume-title":"Proc. 15th LICS","author":"A. Blumensath","year":"2000","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proc. 15th LICS, pp. 51\u201362. IEEE Computer Society, Los Alamitos (2000)"},{"key":"44_CR10","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":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C. Campeanu","year":"2001","unstructured":"Campeanu, C., Culik II, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages, automata implementation. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. Handbook of Formal Languages, ch. 2 (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"issue":"1-4","key":"44_CR13","first-page":"471","volume":"64","author":"S. Yu","year":"2005","unstructured":"Yu, S.: State complexity: recent results and open problems. Fundamenta Informaticae\u00a064(1-4), 471\u2013480 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"44_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)"},{"key":"44_CR15","volume-title":"Proc. LC 2007","author":"B. Khoussainov","year":"2008","unstructured":"Khoussainov, B., Minnes, M.: Three lectures on automatic structures. In: Proc. LC 2007. Cambridge University Press, Cambridge (2008)"},{"issue":"2","key":"44_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(2), 169\u2013209 (2008)","journal-title":"Bulletin of Symbolic Logic"},{"key":"44_CR17","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. Theoretical Computer Science\u00a019, 331\u2013335 (1982)","journal-title":"Theoretical Computer Science"},{"key":"44_CR18","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":"44_CR19","unstructured":"Blumensath, A.: Automatic Structures. Diploma thesis, RWTH Aachen (1999)"},{"issue":"4","key":"44_CR20","first-page":"467","volume":"6","author":"B. Khoussainov","year":"2001","unstructured":"Khoussainov, B., Rubin, S.: Graphs with automatic presentations over a unary alphabet. J. of Automata, Languages and Combinatorics\u00a06(4), 467\u2013480 (2001)","journal-title":"J. of Automata, Languages and Combinatorics"},{"key":"44_CR21","series-title":"Lecture Notes in Computer Science","first-page":"548","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.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 548\u2013559. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T03:32:25Z","timestamp":1551929545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}