Monoidal-Closed Categories of Tree Automata

Colin Riba (1)

1 LIP - Laboratoire de l'Informatique du Parallélisme

We propose a realizability semantics for automata on infinite trees, based on categories of games built on usual simple games, and generalizing usual acceptance games of tree automata. Our approach can be summarized with the slogan " automata as objects, strategies as morphisms ". We show that the operations on tree automata used in the translations of MSO-formulae to automata (underlying Rabin's Theorem, that is the decidability of MSO on infinite trees) can be organized in a deduction system based on the multiplica-tive fragment of intuitionistic linear logic (ILL). Namely, we equip a variant of usual alternating tree automata (that we call uniform tree automata) with a fi-bred monoidal closed structure which in particular, via game determinacy handles a linear complementation of alternating automata, as well as deduction rules for exis-tential and universal quantifications. This monoidal structure is actually Cartesian on non-deterministic automata. Moreover, an adaptation of a usual construction for the simulation of alternating automata by non-deterministic ones satisfies the deduction rules of the !(−) ILL-exponential modality. Our realizability semantics satisfies an expected property of witness extraction from proofs of existential statements. Moreover, it allows to combine realizers produced as interpretations of proofs with strategies witnessing (non-)emptiness of tree automata, possibly obtained using external algorithms.

Mots clés: Automata on infinite trees; Categorical logic; Game semantics

Domaines: Logique en informatique [cs.LO]

Colin Riba. Monoidal-Closed Categories of Tree Automata. 2017. ⟨hal-01261183v5⟩