Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science
A combinatorial problem on Trapezoidal words
Theoretical Computer Science
Theoretical Computer Science
Semiperiodic words and root-conjugacy
Theoretical Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Survey of Some Quantitative Approaches to the Notion of Information
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
A survey of some quantitative approaches to the notion of information
Formal and natural computing
Local periods and binary partial words: an algorithm
Theoretical Computer Science
On average sequence complexity
Theoretical Computer Science
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Lower bounds for restricted read-once parity branching programs
Theoretical Computer Science
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
Algorithms for subsequence combinatorics
Theoretical Computer Science
Combinatorics of Finite Words and Suffix Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Efficient reconstruction of RC-equivalent strings
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
A linear algorithm for string reconstruction in the reverse complement equivalence model
Journal of Discrete Algorithms
Periods in partial words: An algorithm
Journal of Discrete Algorithms
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
A generalized palindromization map in free monoids
Theoretical Computer Science
Enumeration and structure of trapezoidal words
Theoretical Computer Science
Hi-index | 5.24 |