Information Processing Letters
Relationally Periodic Sequences and Subword Complexity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A generalization of Thue freeness for partial words
Theoretical Computer Science
Overlap-freeness in infinite partial words
Theoretical Computer Science
Note: Testing avoidability on sets of partial words is hard
Theoretical Computer Science
How Many Holes Can an Unbordered Partial Word Contain?
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Counting distinct squares in partial words
Acta Cybernetica
Alphabetical satisfiability problem for trace equations
Acta Cybernetica
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On the complexity of deciding avoidability of sets of partial words
Theoretical Computer Science
On minimal Sturmian partial words
Discrete Applied Mathematics
Minimum number of holes in unavoidable sets of partial words of size three
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Avoiding large squares in partial words
Theoretical Computer Science
Unary pattern avoidance in partial words dense with holes
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Avoiding abelian powers in partial words
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Periodicity algorithms for partial words
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Avoiding abelian squares in partial words
Journal of Combinatorial Theory Series A
Binary de bruijn partial words with one hole
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The three-squares lemma for partial words with one hole
Theoretical Computer Science
Abelian square-free partial words
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Avoidable binary patterns in partial words
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Hard counting problems for partial words
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Periods in partial words: an algorithm
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Constructing partial words with subword complexities not achievable by full words
Theoretical Computer Science
Number of holes in unavoidable sets of partial words I
Journal of Discrete Algorithms
Deciding representability of sets of words of equal length
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Squares in binary partial words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Periods in partial words: An algorithm
Journal of Discrete Algorithms
Connecting partial words and regular languages
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Abelian pattern avoidance in partial words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computing regularities in strings: A survey
European Journal of Combinatorics
Repetition-freeness with Cyclic Relations and Chain Relations
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Length-k-overlap-free Binary Infinite Words
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences
Deciding representability of sets of words of equal length
Theoretical Computer Science
Several extensions of the Parikh matrix L-morphism
Journal of Computer and System Sciences
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Computing the partial word avoidability indices of binary patterns
Journal of Discrete Algorithms
Computing the partial word avoidability indices of ternary patterns
Journal of Discrete Algorithms
Recurrence in infinite partial words
Theoretical Computer Science
Regular languages of partial words
Information Sciences: an International Journal
Hi-index | 0.01 |
The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnology, data communication, and DNA computing. Delving into this emerging research area, Algorithmic Combinatorics on Partial Words presents a mathematical treatment of combinatorics on partial words designed around algorithms and explores up-and-coming techniques for solving partial word problems as well as the future direction of research. This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words. Setting the tone for future research in this field, this book lucidly develops the central ideas and results of combinatorics on partial words.