Binary equality sets are generated by two words
  We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different letters.   This in particular implies that any binary language has a test set of cardinality at most two. 
\v{S}t\v{e}p\'an Holub
cs.FL math.CO