Flatwords and Post Correspondence Problem

Author： Harju T.   Lipponen M.   Mateescu A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.161, Iss.1, 1996-07, pp. : 93-108

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Binary (generalized) Post Correspondence Problem

By Halava V.   Harju T.   Hirvensalo  

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 183-204

Elsevier

Access to resources Recommend Favorite

Using DNA to solve the Bounded Post Correspondence Problem

By Kari L.   Gloor G.   Yu S.  

Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. : 193-203

Elsevier

Access to resources Recommend Favorite

Shape and the Stereo Correspondence Problem

By Ogale Abhijit   Aloimonos Yiannis  

International Journal of Computer Vision, Vol. 65, Iss. 3, 2005-12 ,pp. : 147-162

Springer Publishing Company

Access to resources Recommend Favorite

Correspondence

By Olson Judy M.  

The Cartographic Journal, Vol. 15, Iss. 2, 1978-12 ,pp. : 104-105

Maney Publishing

Access to resources Recommend Favorite

Correspondence

By Williams R. L.  

The Cartographic Journal, Vol. 14, Iss. 2, 1977-12 ,pp. : 80-80

Maney Publishing

Access to resources Recommend Favorite