Cost Automata, Safe Schemes, and Downward Closures - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Cost Automata, Safe Schemes, and Downward Closures

Abstract

Higher-order recursion schemes are an expressive formalism used to define languages of possibly infinite ranked trees. They extend regular and context-free grammars, and are equivalent to simply typed λY-calculus and collapsible pushdown automata. In this work we prove, under a syntactical constraint called safety, decidability of the model-checking problem for recursion schemes against properties defined by alternating B-automata, an extension of alternating parity automata for infinite trees with a boundedness acceptance condition. We then exploit this result to show how to compute downward closures of languages of finite trees recognized by safe recursion schemes.
Fichier principal
Vignette du fichier
LIPIcs-ICALP-2020-109.pdf (573.86 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03105650 , version 1 (13-01-2021)

Identifiers

Cite

David Barozzini, Lorenzo Clemente, Thomas Colcombet, Paweł Parys. Cost Automata, Safe Schemes, and Downward Closures. 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken (virtual), Germany. ⟨10.4230/LIPIcs.ICALP.2020.109⟩. ⟨hal-03105650⟩
53 View
39 Download

Altmetric

Share

Gmail Facebook X LinkedIn More