is there any tree automata model over unranked trees (that is with unbounded number of children for each node), such that:
- Checking non-emptiness and universality is decidable in elementary time,
- Construction of automata recognizing a projection and the complementation in polynomial size of the input automata, and
- Automata is non-deterministic and top-down.
The usual hedge-automata model does not suit me.