Handbook of formal languages, vol. 1
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science
Theory of Codes
Theoretical Computer Science
Local periods and binary partial words: an algorithm
Theoretical Computer Science
On unique, multiset, and set decipherability of three-word codes
IEEE Transactions on Information Theory
Deciding multiset decipherability
IEEE Transactions on Information Theory
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Discrete Applied Mathematics
Testing primitivity on partial words
Discrete Applied Mathematics
Theoretical Computer Science
Theoretical Computer Science
Overlap-freeness in infinite partial words
Theoretical Computer Science
Discrete Applied Mathematics
Two element unavoidable sets of partial words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Regular languages of partial words
Information Sciences: an International Journal
| Hi-index | 5.23 |
Codes play an important role in the study of the combinatorics of words. In this paper, we introduce pcodes that play a role in the study of combinatorics of partial words. Partial words are strings over a finite alphabet that may contain a number of "do not know" symbols. Pcodes are defined in terms of the compatibility relation that considers two strings over the same alphabet that are equal except for a number of insertions and/or deletions of symbols. We describe various ways of defining and analyzing pcodes, In particular, many pcodes can be obtained as antichains with respect to certain partial orderings. Using a technique related to dominoes, we show that the pcode property is decidable.