Closure properties of predicates recognized by deterministic and non-deterministic asynchronous automata