| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950638 | Information and Computation | 2017 | 22 Pages |
Abstract
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 the notion of accepting run by allowing a certain quantity of rejecting branches. More precisely we study the following criteria for a run to be accepting:
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Arnaud Carayol, Olivier Serre,