The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Multiple factorizations of words and defect effect
Theoretical Computer Science
Theoretical Computer Science
Some results on k-power-free morphisms
Theoretical Computer Science
Locally periodic versus globally periodic infinite words
Journal of Combinatorial Theory Series A
Theoretical Computer Science
Conway's problem for three-word sets
Theoretical Computer Science
On the combinatorial alphabets of a language
Journal of Automata, Languages and Combinatorics
Context-free languages of sub-exponential growth
Journal of Computer and System Sciences
Theoretical Computer Science
A defect theorem for bi-infinite words
Theoretical Computer Science
Variations on a Theorem of Fine & Wilf
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Periods of Partial Words
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Finite Test-Sets for Overlap-Free Morphisms
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Branching Point Approach to Conway's Problem
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Binary Patterns in Infinite Binary Words
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Relations between Local and Global Periodicity of Words
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Centralizer of a Finite Set
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Combinatorics of Periods in Strings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Commutation with Codes and Ternary Sets of Words
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Repetition Complexity of Words
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Combinatorial and Computational Problems on Finite Sets of Words
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Periodicity, morphisms, and matrices
Theoretical Computer Science - Mathematical foundations of computer science
The branching point approach to Conway's problem
Formal and natural computing
Binary patterns in infinite binary words
Formal and natural computing
Nonrepetitive colorings of graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Non-repetitive colorings of infinite sets
Discrete Mathematics
Conjugacy and episturmian morphisms
Theoretical Computer Science
Finding approximate repetitions under Hamming distance
Theoretical Computer Science - Logic and complexity in computer science
On the independence of equations in three variables
Theoretical Computer Science - WORDS
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c
Information and Computation
Combinatorics of periods in strings
Journal of Combinatorial Theory Series A
Local periods and binary partial words: an algorithm
Theoretical Computer Science
Reconstruction from subsequences
Journal of Combinatorial Theory Series A
Crucial words and the complexity of some extremal problems for sets of prohibited words
Journal of Combinatorial Theory Series A
Trajectory-based embedding relations
Fundamenta Informaticae
Overlap-free morphisms and finite test-sets
Discrete Applied Mathematics
Many aspects of defect theorems
Theoretical Computer Science - Words, languages and combinatorics
Linear-time computation of local periods
Theoretical Computer Science
Border correlation of binary words
Journal of Combinatorial Theory Series A
Patterns in words and languages
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Information Processing Letters
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
A proof of the extended Duval's conjecture
Theoretical Computer Science - Combinatorics on words
On a conjecture about finite fixed points of morphisms
Theoretical Computer Science - Combinatorics on words
Theoretical Computer Science - The art of theory
The non-parametrizability of the word equation xyz=zvx: a short proof
Theoretical Computer Science - Mathematical foundations of computer science 2004
A generalization of repetition threshold
Theoretical Computer Science - Mathematical foundations of computer science 2004
Periodic and Sturmian languages
Information Processing Letters
Discrete Applied Mathematics
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Identification of biRFSA languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Testing primitivity on partial words
Discrete Applied Mathematics
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Letter frequency in infinite repetition-free words
Theoretical Computer Science
Existence of finite test-sets for k-power-freeness of uniform morphisms
Discrete Applied Mathematics
Theoretical Computer Science
Multiple constraints on three and four words
Theoretical Computer Science
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
Discontinuities in pattern inference
Theoretical Computer Science
Periodicity properties on partial words
Information and Computation
On a Special Class of Primitive Words
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
An Analysis and a Reproof of Hmelevskii's Theorem
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Minimum Substring Cover problem
Information and Computation
Journal of Automata, Languages and Combinatorics
Reachability via Cooperating Morphisms
Electronic Notes in Theoretical Computer Science (ENTCS)
Note: Testing avoidability on sets of partial words is hard
Theoretical Computer Science
Unambiguous Erasing Morphisms in Free Monoids
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Communication: On intermediate factorial languages
Discrete Applied Mathematics
Conjugacy of finite biprefix codes
Theoretical Computer Science
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Theoretical Computer Science
Burrows-Wheeler transform and palindromic richness
Theoretical Computer Science
On Finding Small 2-Generating Sets
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science
Everywhere α-repetitive sequences and Sturmian words
European Journal of Combinatorics
On a special class of primitive words
Theoretical Computer Science
Discrete Applied Mathematics
Information Processing Letters
Periodic and Sturmian languages
Information Processing Letters
On maximal repetitions of arbitrary exponent
Information Processing Letters
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Test sets for large families of languages
DLT'03 Proceedings of the 7th international conference on Developments in language theory
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
STACS'99 Proceedings of the 16th 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
The unambiguity of segmented morphisms
DLT'07 Proceedings of the 11th international conference on Developments in language theory
The minimum substring cover problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Combinatorial complexity of regular languages
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
On the complexity of deciding avoidability of sets of partial words
Theoretical Computer Science
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Inclusion problems for patterns with a bounded number of variables
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae
Ultimately constant abelian complexity of infinite words
Journal of Automata, Languages and Combinatorics
Note: Complexity and palindromic defect of infinite words
Theoretical Computer Science
An extension of the Lyndon--Schützenberger result to pseudoperiodic words
Information and Computation
Minimum number of holes in unavoidable sets of partial words of size three
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Local squares, periodicity and finite automata
Rainbow of computer science
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Solving word problems in group extensions over infinite words
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Boolean algebras of regular languages
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
Discrete Applied Mathematics
Unambiguous morphic images of strings
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
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The lempel-ziv complexity of fixed points of morphisms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Online and dynamic recognition of squarefree strings
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Processes, Terms and Cycles
Factorial languages of low combinatorial complexity
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Periods in partial words: an algorithm
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Number of holes in unavoidable sets of partial words II
Journal of Discrete Algorithms
On the Regularity of Iterated Hairpin Completion of a Single Word
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
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
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Problems in between words and abelian words: k-abelian avoidability
Theoretical Computer Science
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
Theoretical Computer Science
Trajectory-Based Embedding Relations
Fundamenta Informaticae
Subwords and Power-Free Words are not Expressible by Word Equations
Fundamenta Informaticae
Fundamenta Informaticae
Fundamenta Informaticae
Remarks on Operations Suggested by Mutations in Genomes
Fundamenta Informaticae
Marked systems and circular splicing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Everywhere α-repetitive sequences and Sturmian words
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Inclusion problems for patterns with a bounded number of variables
Information and Computation
A regularity lemma and twins in words
Journal of Combinatorial Theory Series A
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.03 |