The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable

Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg. The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. Theoretical Computer Science, 21:119-144, 1982.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.