{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:55:35Z","timestamp":1742950535805,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031453281"},{"type":"electronic","value":"9783031453298"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45329-8_6","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:02:40Z","timestamp":1697911360000},"page":"115-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Automata Theoretic Characterization of\u00a0Weighted First-Order Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0845-6754","authenticated-orcid":false,"given":"Dhruv","family":"Nevatia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4717-9955","authenticated-orcid":false,"given":"Benjamin","family":"Monmege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(89)90075-3","volume":"63","author":"JC Birget","year":"1989","unstructured":"Birget, J.C.: Concatenation of inputs in a two-way automaton. Theoret. Comput. Sci. 63(2), 141\u2013156 (1989)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1051\/ita\/1990240100471","volume":"24","author":"JC Birget","year":"1990","unstructured":"Birget, J.C.: Two-way automaton computations. RAIRO-Theor. Inform. Appl. 24(1), 47\u201366 (1990)","journal-title":"RAIRO-Theor. Inform. Appl."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-37075-5_25","volume-title":"Foundations of Software Science and Computation Structures","author":"B Bollig","year":"2013","unstructured":"Bollig, B., Gastin, P., Monmege, B.: Weighted specifications over nested words. In: Pfenning, F. (ed.) FoSSaCS 2013. LNCS, vol. 7794, pp. 385\u2013400. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37075-5_25"},{"doi-asserted-by":"publisher","unstructured":"Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Logical characterization of weighted pebble walking automata. In: CSL-LICS 2014. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603118","key":"6_CR4","DOI":"10.1145\/2603088.2603118"},{"doi-asserted-by":"publisher","unstructured":"Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Pebble weighted automata and weighted logics. ACM Trans. Comput. Log. 15(2:15) (2014). https:\/\/doi.org\/10.1145\/2579819","key":"6_CR5","DOI":"10.1145\/2579819"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift Math. Log. Grundlagen Math. 6, 66\u201392 (1960)","journal-title":"Zeitschrift Math. Log. Grundlagen Math."},{"unstructured":"Carton, O., Dartois, L.: Aperiodic two-way transducers and FO-transductions. Research Report 2103.15651, arXiv (2021)","key":"6_CR7"},{"unstructured":"Dhruv, N., Monmege, B.: An automata theoretic characterization of weighted first-order logic. Research Report 2307.14707, arXiv (2023). https:\/\/arxiv.org\/abs\/2307.14707","key":"6_CR8"},{"issue":"1\u20132","key":"6_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoret. Comput. Sci. 380(1\u20132), 69\u201386 (2007)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Droste, M., Gastin, P.: Aperiodic weighted automata and weighted first-order logic. In: MFCS 2019. No. 76 in LIPIcs, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.76","key":"6_CR10","DOI":"10.4230\/LIPIcs.MFCS.2019.76"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-24897-9_2","volume-title":"Algebraic Foundations in Computer Science","author":"M Droste","year":"2011","unstructured":"Droste, M., G\u00f6tze, D., M\u00e4rcker, S., Meinecke, I.: Weighted tree automata over valuation monoids and their characterization by weighted logics. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 30\u201355. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24897-9_2"},{"key":"6_CR12","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science, Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ic.2012.10.001","volume":"220\u2013221","author":"M Droste","year":"2012","unstructured":"Droste, M., Meinecke, I.: Weighted automata and weighted MSO logics for average and long-time behaviors. Inf. Comput. 220\u2013221, 44\u201359 (2012)","journal-title":"Inf. Comput."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-31606-7_12","volume-title":"Implementation and Application of Automata","author":"M Droste","year":"2012","unstructured":"Droste, M., Pibaljommee, B.: Weighted nested word automata and logics over strong bimonoids. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 138\u2013148. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31606-7_12"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11779148_6","volume-title":"Developments in Language Theory","author":"M Droste","year":"2006","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 49\u201358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779148_6"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00224-009-9224-4","volume":"48","author":"M Droste","year":"2011","unstructured":"Droste, M., Vogler, H.: Weighted logics for unranked tree automata. Theory Comput. Syst. 48, 23\u201347 (2011)","journal-title":"Theory Comput. Syst."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98, 21\u201352 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00224-010-9296-1","volume":"50","author":"Z F\u00fcl\u00f6p","year":"2012","unstructured":"F\u00fcl\u00f6p, Z., St\u00fcber, T., Vogler, H.: A B\u00fcchi-like theorem for weighted tree automata over multioperator monoids. Theory Comput. Syst. 50, 241\u2013278 (2012)","journal-title":"Theory Comput. Syst."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2014.02.034","volume":"534","author":"P Gastin","year":"2014","unstructured":"Gastin, P., Monmege, B.: Adding pebbles to weighted automata: easy specification and efficient evaluation. Theoret. Comput. Sci. 534, 24\u201344 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.02.034","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s00500-015-1952-6","volume":"22","author":"P Gastin","year":"2015","unstructured":"Gastin, P., Monmege, B.: A unifying survey on weighted logics and weighted automata. Soft. Comput. 22(4), 1047\u20131065 (2015). https:\/\/doi.org\/10.1007\/s00500-015-1952-6","journal-title":"Soft. Comput."},{"key":"6_CR21","volume-title":"Counter-Free Automata","author":"RF McNaughton","year":"1971","unstructured":"McNaughton, R.F., Papert, S.A.: Counter-Free Automata, vol. 65. MIT Press, Cambridge (1971)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inf. Control 4, 245\u2013270 (1961)","journal-title":"Inf. Control"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"6_CR24","first-page":"326","volume":"149","author":"BA Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Dokl. Akad. Nauk SSSR 149, 326\u2013329 (1961)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45329-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:03:38Z","timestamp":1697911418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45329-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453281","9783031453298"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45329-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2023\/","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":"115","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":"30","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":"26% - 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.05","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":"9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7 tool papers","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)"}}]}}