{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:58:53Z","timestamp":1743083933671,"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_3","type":"book-chapter","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:07:34Z","timestamp":1582589254000},"page":"33-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approaching Arithmetic Theories with Finite-State Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5452-936X","authenticated-orcid":false,"given":"Christoph","family":"Haase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata (extended abstract). In: Automata, Languages and Programming, ICALP. Lect. Notes Comp. Sci., vol. 1443, pp. 152\u2013163. Springer (1998)","DOI":"10.1007\/BFb0055049"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Logic Programming, ICLP. Lect. Notes Comp. Sci., vol. 2401, pp. 1\u201319. Springer (2002)","DOI":"10.1007\/3-540-45619-8_1"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Boudet, A., Comon, H.: Diophantine equations, presburger arithmetic and finite automata. In: Trees in Algebra and Programming - CAAP. Lect. Notes Comp. Sci., vol. 1059, pp. 30\u201343. Springer (1996)","DOI":"10.1007\/3-540-61064-2_27"},{"issue":"2","key":"3_CR4","first-page":"191","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. Simon Stevin 1(2), 191\u2013238 (1994)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Durand-Gasselin, A., Habermehl, P.: On the use of non-deterministic automata for presburger arithmetic. In: Concurrency Theory - CONCUR. Lect. Notes Comp. Sci., vol. 6269, pp. 373\u2013387. Springer (2010)","DOI":"10.1007\/978-3-642-15375-4_26"},{"key":"3_CR6","unstructured":"Durand-Gasselin, A., Habermehl, P.: Ehrenfeucht-fra\u00efss\u00e9 goes elementarily automatic for structures of bounded degree. In: Symposium on Theoretical Aspects of Computer Science, STACS. LIPIcs, vol. 14, pp. 242\u2013253. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. T. Am. Math. Soc. pp. 333\u2013368 (1964)","DOI":"10.1090\/S0002-9947-1964-0181500-1"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gu\u00e9pin, F., Haase, C., Worrell, J.: On the existential theories of B\u00fcchi arithmetic and linear $$p$$-adic fields. In: Logic in Computer Science, LICS. IEEE (2019)","DOI":"10.1109\/LICS.2019.8785681"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Klaedtke, F.: Bounds on the automata size for presburger arithmetic. ACM Trans. Comput. Log. 9(2), 11:1\u201311:34 (2008)","DOI":"10.1145\/1342991.1342995"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Leroux, J., Point, G.: Tapas: The talence presburger arithmetic suite. In: Tools and Algorithms for the Construction and Analysis of Systems, TACAS. Lect. Notes Comp. Sci., vol. 5505, pp. 182\u2013185. Springer (2009)","DOI":"10.1007\/978-3-642-00768-2_18"},{"key":"3_CR11","first-page":"41","volume":"33","author":"LM Lipshitz","year":"1981","unstructured":"Lipshitz, L.M.: Some remarks on the Diophantine problem for addition and divisibility. Proc. Model Theory Meeting. 33, 41\u201352 (1981)","journal-title":"Proc. Model Theory Meeting."},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0022-0000(78)90044-2","volume":"16","author":"KL Manders","year":"1978","unstructured":"Manders, K.L., Adleman, L.M.: NP-complete decision problems for binary quadratics. J. Comput. Syst. Sci. 16(2), 168\u2013184 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1112\/blms\/14.2.149","volume":"14","author":"CR Matthews","year":"1982","unstructured":"Matthews, C.R.: Counting Points Modulo $$p$$ for some Finitely Generated Subgroups of Algebraic Groups. Bull. Lond. Math. Soc. 14(2), 149\u2013154 (1982)","journal-title":"Bull. Lond. Math. Soc."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"McCurley, K.S.: The discrete logarithm problem. Proc. of Symp. in Applied Math. 42, 49\u201374 (1990)","DOI":"10.1090\/psapm\/042\/1095551"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Scarpellini, B.: Complexity of subcases of Presburger arithmetic. T. Am. Math. Soc. 284, 203\u2013218 (1984)","DOI":"10.1090\/S0002-9947-1984-0742421-9"},{"key":"3_CR16","unstructured":"The Li\u00e8ge automata-based symbolic handler (LASH): Available at http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"To, A.W.: Unary finite automata vs. arithmetic progressions. Inf. Process. Lett. 109(17), 1010\u20131014 (2009)","DOI":"10.1016\/j.ipl.2009.06.005"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Weispfenning, V.: The complexity of linear problems in fields. J. Symb. Comput. 5(1\/2), 3\u201327 (1988)","DOI":"10.1016\/S0747-7171(88)80003-8"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Wolper, P., Boigelot, B.: On the construction of automata from linear arithmetic constraints. In: Tools and Algorithms for the Construction and Analysis of Systems, TACAS. Lect. Notes Comp. Sci., vol. 1785, pp. 1\u201319. Springer (2000)","DOI":"10.1007\/3-540-46419-0_1"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T20:42:10Z","timestamp":1741466530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40608-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406073","9783030406080"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40608-0_3","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"}]}}