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.

[1]  M. Lothaire.  Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .

[2]  André Lentin.  Equations in Free Monoids , 1972, ICALP.

[3]  Karel Culik,et al.  On the Equality Sets for Homomorphisms on Free Monoids with Two Generators , 1980, RAIRO Theor. Informatics Appl..

[4]  J. Berstel,et al.  Sur le théorème du défaut , 1979 .

[5]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[6]  Tero Harju,et al.  Some New Results on Post Correspondence Problem and Its Modifications , 2001, Bull. EATCS.

[7]  Andrzej Ehrenfeucht,et al.  On binary equality sets and a solution to the test set conjecture in the binary case , 1983 .

[8]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[9]  Tero Harju,et al.  Binary (generalized) Post Correspondence Problem , 2002, Theor. Comput. Sci..

[10]  Tero Harju,et al.  POST CORRESPONDENCE PROBLEM – RECENT RESULTS , 2004 .

[11]  Tero Harju,et al.  Generalized Post Correspondence Problem for Marked Morphisms , 2000, Int. J. Algebra Comput..

[12]  Vesa Halava,et al.  Binary ( Generalized ) Post Correspondence Problem is in P TUCS , 2006 .

[13]  Stepan Holub.  A Unique Structure of Two-Generated Binary Equality Sets , 2002, Developments in Language Theory.

[14]  Andrzej Ehrenfeucht,et al.  The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable , 1982, Theor. Comput. Sci..

[15]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[16]  Arto Salomaa.  Equality sets for homomorphisms of free monoids , 1978, Acta Cybern..