Cost Automata, Safe Schemes, and Downward Closures
David Barozzini,Lorenzo Clemente,Thomas Colcombet,Paweł Parys +3 more
- pp 18
Reads0
Chats0
TLDR
In this article, the 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, was shown.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 schemesread more
Citations
More filters
Proceedings ArticleDOI
Existential Definability over the Subword Ordering
TL;DR: First-order logic over the structure consisting of finite words over some alphabet A, together with the (non-contiguous) subword ordering is studied, showing that if | A | ≥ 3, then a relation is definable in the existential fragment over A with constants if and only if it is recursively enumerable.
Proceedings ArticleDOI
Unboundedness problems for machines with reversal-bounded counters
Pascal Baumann,Flavio D'Alessandro,Moses Ganardi,Oscar A. Ibarra,Ian McQuillan,Lia Schütze,Georg Zetzsche +6 more
TL;DR: In this paper , a general class of decision problems concerning formal languages, called ''one-dimensional) unboundedness predicates'' for automata that feature reversal-bounded counters (RBCA), is considered.
Posted Content
Cost Automata, Safe Schemes, and Downward Closures
TL;DR: This work proves, 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, and exploits this result to show how to compute downward closures of languages of finite trees recognized by safe recursions schemes.
Book ChapterDOI
Unboundedness Problems for Machines with Reversal-Bounded Counters
TL;DR: In this article , a general class of decision problems concerning formal languages, called (one-dimensional) unboundedness predicates, for automata that feature reversal-bounded counters (RBCA) was considered.