On binary equality sets and a solution to the test set conjecture in the binary case

This publication has 9 references indexed in Scilit:

• Systems of equations over a free monoid and Ehrenfeucht's conjecture
  Discrete Mathematics, 1983
• The (generalized) post correspondence problem with lists consisting of two words is decidable
  Theoretical Computer Science, 1982
• Test sets for context free languages and algebraic systems of equations over a free monoid
  Information and Control, 1982
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
  Journal of the ACM, 1980
• Test sets and checking words for homomorphism equivalence
  Journal of Computer and System Sciences, 1980
• On the equality sets for homomorphisms on free monoids with two generators
  RAIRO. Informatique théorique, 1980
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
  Journal of the ACM, 1979
• The decidability of the equivalence problem for DOL-systems
  Information and Control, 1977
• A variant of a recursively unsolvable problem
  Bulletin of the American Mathematical Society, 1946