Completeness results concerning systolic tree automata and EOL languages