{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T12:07:01Z","timestamp":1780920421089,"version":"3.54.1"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002661","name":"Fund for Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116048","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T23:25:10Z","timestamp":1779319510000},"page":"116048","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Deciding reachability in automata on words indexed by the reals and rationals"],"prefix":"10.1016","volume":"1080","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4721-3824","authenticated-orcid":false,"given":"Bernard","family":"Boigelot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4700-6031","authenticated-orcid":false,"given":"Pascal","family":"Fontaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5545-4579","authenticated-orcid":false,"given":"Baptiste","family":"Vergain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.116048_bib0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","article-title":"Automata on linear orderings","volume":"73","author":"Bruy\u00e8re","year":"2007","journal-title":"J. Comput. Syst. Sci."},{"issue":"03","key":"10.1016\/j.tcs.2026.116048_bib0002","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1142\/S0129054106003978","article-title":"A Kleene theorem for languages of words indexed by linear orderings","volume":"17","author":"B\u00e8s","year":"2006","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116048_bib0003","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00224-009-9222-6","article-title":"Logic and rational languages of words indexed by linear orderings","volume":"46","author":"Bedon","year":"2010","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.116048_bib0004","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"10.1016\/j.tcs.2026.116048_bib0005","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1971037","article-title":"The monadic theory of order","volume":"102","author":"Shelah","year":"1975","journal-title":"Ann. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.116048_bib0006","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1305\/ndjfl\/1093870820","article-title":"The decision problem for linear temporal logic","volume":"26","author":"Burgess","year":"1985","journal-title":"Notre Dame J. Form. Log."},{"key":"10.1016\/j.tcs.2026.116048_bib0007","article-title":"On the theory of order over real numbers","author":"Boigelot","year":"2025","journal-title":"Math. Comput. Sci."},{"issue":"8","key":"10.1016\/j.tcs.2026.116048_bib0008","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1016\/j.apal.2010.01.002","article-title":"The complexity of temporal logic over the reals","volume":"161","author":"Reynolds","year":"2010","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1016\/j.tcs.2026.116048_bib0009","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ic.2011.11.002","article-title":"Temporal logics over linear time domains are in PSPACE","volume":"210","author":"Rabinovich","year":"2012","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.116048_bib0010","unstructured":"J.R. B\u00fcchi, On a decision method in restricted second order arithmetic, in: Proc. Intl. Congress on Logic, Methodology and Philosophy of Science, 1960."},{"key":"10.1016\/j.tcs.2026.116048_bib0011","series-title":"Proc. Intl. Congress on Logic, Methodology, and Philosophy of Science","article-title":"Transfinite automata recursions and weak second order theory of ordinals","author":"B\u00fcchi","year":"1965"},{"key":"10.1016\/j.tcs.2026.116048_bib0012","series-title":"Proc. Intl. Symp. on Mathematical Foundations of Computer Science","first-page":"155","article-title":"Accessibility in automata on scattered linear orderings","author":"Carton","year":"2002"},{"key":"10.1016\/j.tcs.2026.116048_bib0013","series-title":"Proc. Intl. Conf. on Foundations of Software Technology and Theoretical Computer Science","first-page":"133","article-title":"Automata and temporal logic over arbitrary linear time","volume":"4","author":"Cristau","year":"2009"},{"key":"10.1016\/j.tcs.2026.116048_bib0014","series-title":"Implementation and Application of Automata","first-page":"94","article-title":"Non-emptiness test for automata over words indexed by the reals and rationals","volume":"15015","author":"Boigelot","year":"2024"},{"key":"10.1016\/j.tcs.2026.116048_bib0015","series-title":"Linear Orderings","author":"Rosenstein","year":"1982"},{"key":"10.1016\/j.tcs.2026.116048_bib0016","series-title":"Proc. Annual Symp. on Switching Circuit Theory and Logical Design","first-page":"3","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963"},{"issue":"1","key":"10.1016\/j.tcs.2026.116048_bib0017","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","article-title":"Finite automata, definable sets, and regular expressions over \u03c9n-tapes","volume":"17","author":"Choueka","year":"1978","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.116048_bib0018","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF02124929","article-title":"Beitr\u00e4ge zur Begr\u00fcndung der transfiniten Mengenlehre","volume":"46","author":"Cantor","year":"1895","journal-title":"Math. Ann."},{"key":"10.1016\/j.tcs.2026.116048_bib0019","series-title":"Cardinal and Ordinal Numbers","author":"Sierpi\u0144ski","year":"1965"},{"issue":"1","key":"10.1016\/j.tcs.2026.116048_bib0020","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01443330","article-title":"\u00dcber unendliche, lineare Punktmannichfaltigkeiten","volume":"20","author":"Cantor","year":"1882","journal-title":"Math. Ann."},{"key":"10.1016\/j.tcs.2026.116048_bib0021","series-title":"Real Analysis","author":"DiBenedetto","year":"2002"},{"issue":"1","key":"10.1016\/j.tcs.2026.116048_bib0022","doi-asserted-by":"crossref","first-page":"109","DOI":"10.4064\/fm-59-1-109-116","article-title":"On the elementary theory of linear order","volume":"59","author":"L\u00e4uchli","year":"1966","journal-title":"Fundam. Math."},{"key":"10.1016\/j.tcs.2026.116048_bib0023","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","article-title":"On a problem of formal logic","volume":"30","author":"Ramsey","year":"1930","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.tcs.2026.116048_bib0024","author":"Braipson"},{"key":"10.1016\/j.tcs.2026.116048_bib0025","article-title":"Universal first-order quantification over automata","author":"Boigelot","year":"2025","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002987?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002987?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T11:32:15Z","timestamp":1780918335000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":25,"alternative-id":["S0304397526002987"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116048","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deciding reachability in automata on words indexed by the reals and rationals","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116048","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116048"}}