Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Handbook of Formal Languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Codes, orderings, and partial words
Theoretical Computer Science
Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Hard counting problems for partial words
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Connecting partial words and regular languages
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.07 |
We initiate a study of languages of partial words related to regular languages of full words. First, we investigate the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words by a finite set of letters. Results regarding the structure, uniqueness and succinctness of such a representation, as well as a series of related decidability and computational-hardness results, are presented. Finally, we introduce a hierarchy of classes of languages of partial words, by grouping together languages that can be connected in various strong ways to regular languages, and derive their closure properties with respect to several regular operations.