A “Fourier Transform” for Multiplicative Functionson Non-Crossing Partitions
Journal of Algebraic Combinatorics: An International Journal
Unavoidable sets of words of uniform length
Information and Computation
Shuffle factorization is unique
Theoretical Computer Science
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
On a conjecture on bidimensional words
Theoretical Computer Science
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Conjugacy and episturmian morphisms
Theoretical Computer Science
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
Words whose complexity satisfies lim p(n)/n = 1
Theoretical Computer Science - WORDS
Lyndon factorization of the Prouhet words
Theoretical Computer Science - WORDS
Recognizing string graphs in NP
Journal of Computer and System Sciences - STOC 2002
Crucial words and the complexity of some extremal problems for sets of prohibited words
Journal of Combinatorial Theory Series A
Real numbers having ultimately periodic representations in abstract numeration systems
Information and Computation
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Border correlation of binary words
Journal of Combinatorial Theory Series A
Growth of repetition-free words: a review
Theoretical Computer Science - The art of theory
Occurrences of palindromes in characteristic Sturmian words
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
Segmental partially ordered generalized patterns
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
The origins of combinatorics on words
European Journal of Combinatorics
Waiting times for clumps of patterns and for structured motifs in random sequences
Discrete Applied Mathematics
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science
Discrete Applied Mathematics
Infinite unfair shuffles and associativity
Theoretical Computer Science
Discrete rotations and symbolic dynamics
Theoretical Computer Science
A note on the number of squares in a word
Theoretical Computer Science
Periodicity and unbordered words: A proof of the extended duval conjecture
Journal of the ACM (JACM)
Existence of finite test-sets for k-power-freeness of uniform morphisms
Discrete Applied Mathematics
On Dejean's conjecture over large alphabets
Theoretical Computer Science
Theoretical Computer Science
Completing circular codes in regular submonoids
Theoretical Computer Science
A basis for the right quantum algebra and the "1=q" principle
Journal of Algebraic Combinatorics: An International Journal
On different generalizations of episturmian words
Theoretical Computer Science
Maximal repetitions in strings
Journal of Computer and System Sciences
Matrices of 3-iet preserving morphisms
Theoretical Computer Science
Kernel methods for learning languages
Theoretical Computer Science
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Counting Ordered Patterns in Words Generated by Morphisms
Language and Automata Theory and Applications
Well Quasi-orders in Formal Language Theory
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Average State Complexity of the Star of a Finite Set of Words Is Linear
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On a Generalization of Standard Episturmian Morphisms
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Relationally Periodic Sequences and Subword Complexity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Efficient on-line repetition detection
Theoretical Computer Science
The descent statistic on involutions is not log-concave
European Journal of Combinatorics
Long binary patterns are Abelian 2-avoidable
Theoretical Computer Science
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
The complexity of nonrepetitive coloring
Discrete Applied Mathematics
On the tiling by translation problem
Discrete Applied Mathematics
Journal of Automata, Languages and Combinatorics
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Lyndon + Christoffel = digitally convex
Pattern Recognition
Characteristic morphisms of generalized episturmian words
Theoretical Computer Science
Relation between powers of factors and the recurrence function characterizing Sturmian words
Theoretical Computer Science
Combinatorics of Finite Words and Suffix Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Everywhere α-repetitive sequences and Sturmian words
European Journal of Combinatorics
Discrete Applied Mathematics
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
Involutions of epicentral words
European Journal of Combinatorics
Transducers for the bidirectional decoding of prefix codes
Theoretical Computer Science
A local balance property of episturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Combinatorial view of digital convexity
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Two linear-time algorithms for computing the minimum length polygon of a digital contour
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A linear time and space algorithm for detecting path intersection
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
Theoretical Computer Science
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A characterization of (regular) circular languages generated by monotone complete splicing systems
Theoretical Computer Science
Small-space 2D compressed dictionary matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Cover array string reconstruction
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
A local search algorithm for grammatical inference
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
ACM Transactions on Algorithms (TALG)
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
Theoretical Computer Science
The expected profile of digital search trees
Journal of Combinatorial Theory Series A
Dynamic minimum length polygon
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A linear time and space algorithm for detecting path intersection in Zd
Theoretical Computer Science
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the right-seed array of a string
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Discrete Applied Mathematics
On critical exponents in fixed points of binary k-uniform morphisms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Sturmian graphs and integer representations over numeration systems
Discrete Applied Mathematics
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
On primary and secondary repetitions in words
Theoretical Computer Science
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Incremental inference of relational motifs with a degenerate alphabet
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
The lempel-ziv complexity of fixed points of morphisms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An optimal algorithm for detecting pseudo-squares
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Sturmian graphs and a conjecture of moser
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Note: Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Theoretical Computer Science
Theoretical Computer Science
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
RISOTTO: fast extraction of motifs with mismatches
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Counting occurrences for a finite set of words: Combinatorial methods
ACM Transactions on Algorithms (TALG)
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
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A generalization of girod's bidirectional decoding method to codes with a finite deciphering delay
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
An efficient linear pseudo-minimization algorithm for aho-corasick automata
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Analysis of maximal repetitions in strings
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Probabilistic Arithmetic Automata and Their Applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
MoTeX: A word-based HPC tool for MoTif eXtraction
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
A maximal entropy stochastic process for a timed automaton,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.03 |