{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:57Z","timestamp":1725512097807},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_47","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"542-553","source":"Crossref","is-referenced-by-count":1,"title":["Unary Automatic Graphs: An Algorithmic Perspective"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mia","family":"Minnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Blumensath, A.: Automatic Structures. Diploma Thesis, RWTH Aachen (1999)"},{"key":"47_CR2","first-page":"642","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, 642\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"47_CR4","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proc. CLMPS, pp. 1\u201311. Stanford University Press (1960)"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 232\u2013247. Springer, Heidelberg (2000)"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\n                    \n                      \n                    \n                    $\\breve{s}$\n                  et\n                    \n                      \n                    \n                    $\\breve{r}$\n                  il, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"47_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 presentation of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. In: Proc. LICS, pp. 44\u201353 (2004)","DOI":"10.1109\/LICS.2004.1319599"},{"issue":"4","key":"47_CR9","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"},{"issue":"4","key":"47_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":"47_CR11","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: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol.\u00a02850, pp. 344\u2013358. Springer, Heidelberg (2003)"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/978-3-540-31856-9_57","volume-title":"STACS 2005","author":"G.P. Oliver","year":"2005","unstructured":"Oliver, G.P., Thomas, R.M.: Automatic presentations for finitely generated groups. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 693\u2013704. Springer, Heidelberg (2005)"},{"key":"47_CR13","unstructured":"Rubin, S.: Automatic Structures, PhD Thesis, University of Auckland (2004)"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-46011-X_10","volume-title":"Developments in Language Theory","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 130\u2013144. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:25Z","timestamp":1619522065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_47","relation":{},"subject":[]}}