Losing recognizability

We consider the ranked alphabet Σ consisting of a binary symbol. We give a rewrite system R over Σ such that R effectively preserves recognizability on any ranked alphabet obtained by adding finitely many nullary symbols to Σ. However, R does not preserve recognizability on the ranked alphabet obtained by adding one unary and one nullary symbol to Σ.