-
Tree automata help one to solve equational formulae in AC-theories
In this paper we consider particular equational formulae where the equality = AC in the congruence induced by a set of associative-commutative axioms. The formulae we... -
The Determinacy of Context-Free Games
International audience -
The Determinacy of Context-Free Games
This paper is an extended version of a STACS 2012 conference paper. It will appear in the Journal of Symbolic Logic. -
Infinite Games Specified by 2-Tape Automata
The paper published in APAL is a revised version of this preprint
