Document Type

Technical Report

Publication Date

Fall 9-1-1978

Abstract

We demonstrate that to find a homomorphism between two words x and y where letters of x can be chosen from an infinite alphabet and y is a word over a two letter alphabet is an NP-complete problem.

Share

COinS