{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:16Z","timestamp":1762291696026,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09524-4_2","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:06Z","timestamp":1762290846000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Role of\u00a0Logic and\u00a0Automata in\u00a0Understanding Transformers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4715-5096","authenticated-orcid":false,"given":"Anthony W.","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2293-2653","authenticated-orcid":false,"given":"Pablo","family":"Barcelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M Ajtai","year":"1983","unstructured":"Ajtai, M.: $$\\sum  ^{\\text{1 }} _{\\text{1 }}$$-formulae on finite structures. Ann. Pure Appl. Log. 24(1), 1\u201348 (1983)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR2","unstructured":"Barcel\u00f3, P., Kozachinskiy, A., Lin, A.W., Podolskii, V.V.: Logical languages accepted by transformer encoders with hard attention. In: ICLR (2024)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bhattamishra, S., Patel, A., Goyal, N.: On the computational power of transformers and its implications in sequence modeling. In: CoNLL, pp. 455\u2013475 (2020)","DOI":"10.18653\/v1\/2020.conll-1.37"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chiang, D., Cholak, P.: Overcoming a theoretical limitation of self-attention. In: Muresan, S., Nakov, P., Villavicencio, A. (eds.) ACL, pp. 7654\u20137664 (2022)","DOI":"10.18653\/v1\/2022.acl-long.527"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","volume":"14","author":"JL Elman","year":"1990","unstructured":"Elman, J.L.: Finding structure in time. Cogn. Sci. 14(2), 179\u2013211 (1990)","journal-title":"Cogn. Sci."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1162\/tacl_a_00306","volume":"8","author":"M Hahn","year":"2020","unstructured":"Hahn, M.: Theoretical limitations of self-attention in neural sequence models. Trans. Assoc. Comput. Linguistics 8, 156\u2013171 (2020)","journal-title":"Trans. Assoc. Comput. Linguistics"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1162\/tacl_a_00490","volume":"10","author":"Y Hao","year":"2022","unstructured":"Hao, Y., Angluin, D., Frank, R.: Formal language recognition by hard attention transformers: perspectives from circuit complexity. Trans. Assoc. Comput. Linguistics 10, 800\u2013810 (2022)","journal-title":"Trans. Assoc. Comput. Linguistics"},{"key":"2_CR8","unstructured":"Huang, X., et al.: A formal framework for understanding length generalization in transformers. In: ICLR (2025)"},{"key":"2_CR9","unstructured":"Kamp, H.W.: Tense Logic and the Theory of Linear Order. Ph.D. thesis, University of California, Los Angeles (1968)"},{"key":"2_CR10","unstructured":"K\u00f6cher, C., Kozachinskiy, A., Lin, A.W., S\u00e4lzer, M., Zetzsche, G.: Nope: the counting power of transformers with no positional encodings. CoRR arxiv:2505.11199 (2025)"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Kopczynski, E., To, A.W.: Parikh images of grammars: complexity and applications. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, Edinburgh, United Kingdom, 11\u201314 July 2010, pp. 80\u201389 (2010). https:\/\/doi.org\/10.1109\/LICS.2010.21","DOI":"10.1109\/LICS.2010.21"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-662-07003-1"},{"key":"2_CR13","volume-title":"Hilbert\u2019s Tenth Problem","author":"YV Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.V.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge (1993)"},{"key":"2_CR14","unstructured":"Merrill, W., Sabharwal, A.: The expressive power of transformers with chain of thought. In: ICLR (2024)"},{"key":"2_CR15","unstructured":"P\u00e9rez, J., Barcel\u00f3, P., Marinkovic, J.: Attention is turing-complete. J. Mach. Learn. Res. 22, 75:1\u201375:35 (2021)"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science, 1 edn. Birkh\u00e4user Boston (1994). https:\/\/doi.org\/10.1007\/978-1-4612-0289-9","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/tacl_a_00663","volume":"12","author":"L Strobl","year":"2024","unstructured":"Strobl, L., Merrill, W., Weiss, G., Chiang, D., Angluin, D.: What formal languages can transformers express? A survey. Trans. Assoc. Comput. Linguist. 12, 543\u2013561 (2024)","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"2_CR18","unstructured":"Yang, A., Chiang, D.: Counting like transformers: compiling temporal counting logic into softmax transformers. CoRR arxiv:2404.04393 (2024)"},{"key":"2_CR19","unstructured":"Yang, A., Chiang, D., Angluin, D.: Masked hard-attention transformers recognize exactly the star-free languages. In: NeurIPS (2024)"},{"key":"2_CR20","unstructured":"Yang, A., Strobl, L., Chiang, D., Angluin, D.: Simulating hard attention using soft attention. CoRR arxiv:2412.09925 (2024)"},{"key":"2_CR21","unstructured":"Zhou, H., et al.: What algorithms can transformers learn? A study in length generalization. In: ICLR (2024)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:07Z","timestamp":1762290847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}