We show that any right continuing factor code with retract 0 into an irreducible shift of finite type is eresolving, and we give some sufficient conditions for a eresolving almost everywhere being everywhere. Suberesolving codes as generalization ersolving have been introduced and determine spaces which preserved by suberesolving codes. Also, we bi-eresolving (resp. bi-suberesolving)...
