{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:27:13Z","timestamp":1777645633894,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T00:00:00Z","timestamp":1680825600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2023,4,7]]},"abstract":"<jats:p>In this work we prove decidability of the model-checking problem for safe recursion schemes against properties defined by alternating B-automata. We then exploit this result to show how to compute downward closures of languages of finite trees recognized by safe recursion schemes.<\/jats:p>\n                  <jats:p>Higher-order recursion schemes are an expressive formalism used to define languages of finite and infinite ranked trees by means of fixed points of lambda terms. They extend regular and context-free grammars, and are equivalent in expressive power to the simply typed \u03bbY-calculus and collapsible pushdown automata. Safety in a syntactic restriction which limits their expressive power.<\/jats:p>\n                  <jats:p>The class of alternating B-automata is an extension of alternating parity automata over infinite trees; it enhances them with counting features that can be used to describe boundedness properties.<\/jats:p>","DOI":"10.3233\/fi-222145","type":"journal-article","created":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T11:34:42Z","timestamp":1680867282000},"page":"127-178","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Cost Automata, Safe Schemes, and Downward Closures"],"prefix":"10.1177","volume":"188","author":[{"given":"David","family":"Barozzini","sequence":"first","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Warsaw, Poland,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Clemente","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Warsaw, Poland,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Colcombet","sequence":"additional","affiliation":[{"name":"IRIF-CNRS-Universit\u00e9 de Paris, Paris, France,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Parys","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Warsaw, Poland,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2023,4,7]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-222145","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-222145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:49Z","timestamp":1777444369000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-222145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,7]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4,7]]}},"alternative-id":["10.3233\/FI-222145"],"URL":"https:\/\/doi.org\/10.3233\/fi-222145","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,7]]}}}