ABSTRACT
In Section 9.1, we give an analog of the Sardinas and Patterson algorithm for testing whether or not a given finite set of partial words is a pcode. In Section 9.2, we adapt a technique of Head and Weber related to dominoes to show that the pcode property is decidable.
