Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
Theoretical Computer Science
On the Periods of Partial Words
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Local periods and binary partial words: an algorithm
Theoretical Computer Science
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Codes, orderings, and partial words
Theoretical Computer Science
Generalised fine and Wilf's theorem for arbitrary number of periods
Theoretical Computer Science - Combinatorics on words
Discrete Applied Mathematics
Testing primitivity on partial words
Discrete Applied Mathematics
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
Periodicity properties on partial words
Information and Computation
Information Processing Letters
On a Special Class of Primitive Words
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
Discrete Applied Mathematics
How Many Holes Can an Unbordered Partial Word Contain?
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A new approach to the periodicity lemma on strings with holes
Theoretical Computer Science
On a special class of primitive words
Theoretical Computer Science
Discrete Applied Mathematics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Two element unavoidable sets of partial words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Counting distinct squares in partial words
Acta Cybernetica
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Combinatorics on partial word correlations
Journal of Combinatorial Theory Series A
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae
On minimal Sturmian partial words
Discrete Applied Mathematics
Avoiding abelian powers in partial words
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Avoiding abelian squares in partial words
Journal of Combinatorial Theory Series A
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
DNA'04 Proceedings of the 10th international conference on DNA computing
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
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
Deciding representability of sets of words of equal length
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Fine and wilf's theorem for k-abelian periods
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
Fine and wilf's theorem and pseudo-repetitions
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
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
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
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Recurrence in infinite partial words
Theoretical Computer Science
Regular languages of partial words
Information Sciences: an International Journal
| Hi-index | 5.24 |