10 citations · 13 across the 4 of their papers we have counts for
1 paper · 2 filters
Arnaud Carayol, Axel Haddad, Olivier Serre
We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax…