{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:02Z","timestamp":1743154262989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406073"},{"type":"electronic","value":"9783030406080"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-40608-0_9","type":"book-chapter","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:07:34Z","timestamp":1582589254000},"page":"141-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ordered Semiautomatic Rings with Applications to Geometry"],"prefix":"10.1007","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Schlicht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Tarr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Fifteenth Annual IEEE Symposium on Logic in Computer Science, LICS 2000, pp. 51\u201362 (2000)","key":"9_CR1","DOI":"10.1109\/LICS.2000.855755"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Logic 6(3), 614\u2013633 (2005)","journal-title":"ACM Trans. Comput. Logic"},{"doi-asserted-by":"crossref","unstructured":"Case, J., Jain, S., Seah, S., Stephan, F.: Automatic functions, linear time and learning. Logical Methods Comput. Sci. 9(3) (2013)","key":"9_CR3","DOI":"10.2168\/LMCS-9(3:19)2013"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s002360050077","volume":"34","author":"K Culik II","year":"1997","unstructured":"Culik II, K., Kari, J.: Computational fractal geometry with WFA. Acta Informatica 34, 151\u2013166 (1997)","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)","key":"9_CR5","DOI":"10.1201\/9781439865699"},{"unstructured":"Hodgson, B.R.: Th\u00e9ories d\u00e9cidables par automate fini. Ph.D. thesis, D\u00e9partement de math\u00e9matiques et de statistique, Universit\u00e9 de Montr\u00e9al (1976)","key":"9_CR6"},{"issue":"1","key":"9_CR7","first-page":"39","volume":"7","author":"BR Hodgson","year":"1983","unstructured":"Hodgson, B.R.: D\u00e9cidabilit\u00e9 par automate fini. Annales des sciences math\u00e9matiques du Qu\u00e9bec 7(1), 39\u201357 (1983)","journal-title":"Annales des sciences math\u00e9matiques du Qu\u00e9bec"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1007\/s00224-017-9792-7","volume":"61","author":"S Jain","year":"2017","unstructured":"Jain, S., Khoussainov, B., Stephan, F., Teng, D., Zou, S.: Semiautomatic structures. Theory Comput. Syst. 61(4), 1254\u20131287 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"2\u20133","key":"9_CR9","first-page":"20","volume":"381","author":"H J\u00fcrgensen","year":"2007","unstructured":"J\u00fcrgensen, H., Staiger, L., Yamasaki, H.: Finite automata encoding geometric figures. Theor. Comput. Sci. 381(2\u20133), 20\u201330 (2007)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Minnes, M.: Three lectures on automatic structures. In: Proceedings of the Logic Colloquium 2007. Lecture Notes in Logic, vol. 35, pp. 132\u2013176 (2010)","key":"9_CR10","DOI":"10.1017\/CBO9780511778421.008"},{"key":"9_CR11","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. 960, pp. 367\u2013392. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60178-3_93"},{"doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Logical Methods Comput. Sci. 3(2) (2007)","key":"9_CR12","DOI":"10.2168\/LMCS-3(2:2)2007"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.apal.2009.07.006","volume":"161","author":"A Nies","year":"2009","unstructured":"Nies, A., Semukhin, P.: Finite automata presentable Abelian groups. Ann. Pure Appl. Logic 161, 458\u2013467 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.jalgebra.2007.04.015","volume":"320","author":"A Nies","year":"2008","unstructured":"Nies, A., Thomas, R.: FA-presentable groups and rings. J. Algebra 320, 569\u2013585 (2008)","journal-title":"J. Algebra"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-540-31856-9_57","volume-title":"STACS 2005","author":"GP 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. 3404, pp. 693\u2013704. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31856-9_57"},{"key":"9_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. Bull. Symb. Logic 14, 169\u2013209 (2008)","journal-title":"Bull. Symb. Logic"},{"doi-asserted-by":"crossref","unstructured":"Stephan, F.: Automatic structures - recent results and open questions. In: Third International Conference on Science and Engineering in Mathematics, Chemistry and Physics, ScieTech 2015, Journal of Physics: Conference Series, vol. 622, isssue no. 1742\/6596\/622\/1 (2015). https:\/\/iopscience.iop.org\/issue\/1742-6596\/622\/1, 10 pages, Paper No. 012013","key":"9_CR17","DOI":"10.1088\/1742-6596\/622\/1\/012013"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.2178\/jsl\/1318338853","volume":"76","author":"T Tsankov","year":"2011","unstructured":"Tsankov, T.: The additive group of the rationals does not have an automatic presentation. J. Symb. Logic 76(4), 1341\u20131351 (2011)","journal-title":"J. Symb. Logic"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/s00224-013-9508-6","volume":"55","author":"FA Zaid","year":"2014","unstructured":"Zaid, F.A., Gr\u00e4del, E., Kaiser, L., Pakusa, W.: Model-theoretic properties of $$\\omega $$-automatic structures. Theory Comput. Syst. 55, 856\u2013880 (2014)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40608-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T20:42:11Z","timestamp":1741466531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40608-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406073","9783030406080"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40608-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lata2020.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there are 6 invited papers. Due to the coronavirus pandemic the actual conference was postponed to be held together with LATA 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}