Cost Automata, Safe Schemes, and Downward Closures - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2023

Cost Automata, Safe Schemes, and Downward Closures

Résumé

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. 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 λY-calculus and collapsible pushdown automata. Safety in a syntactic restriction which limits their expressive power. 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.

Dates et versions

hal-04324097 , version 1 (05-12-2023)

Identifiants

Citer

David Barozzini, Lorenzo Clemente, Thomas Colcombet, Paweł Parys. Cost Automata, Safe Schemes, and Downward Closures. Fundamenta Informaticae, 2023, 188 (3), pp.127-178. ⟨10.3233/FI-222145⟩. ⟨hal-04324097⟩
13 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More