论文信息 - Binary Intersection Revisited

Binary Intersection Revisited

We reformulate the classical result by Juhani Karhumaki characterizing intersections of two languages of the form \(\{x,y\}^*\cap \{u,v\}^*\). We use the terminology of morphisms which allows to formulate the result in a shorter and more transparent way.

Stepan Holub

[1] Juhani Karhumäki. A note on intersections of free submonoids of a free monoid , 1984 .

[2] M. Lothaire,et al. Combinatorics on words: Frontmatter , 1997 .

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

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

[5] Vesa Halava,et al. Reduction Tree of the Binary Generalized Post Correspondence Problem , 2011, Int. J. Found. Comput. Sci..

[6] M. Lothaire. Combinatorics on words: Bibliography , 1997 .

[7] Christian Choffrut,et al. Combinatorics of Words , 1997, Handbook of Formal Languages.

[8] Stepan Holub. Binary equality sets are generated by two words , 2012, ArXiv.