| Publication | Date of Publication | Type |
|---|
Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
Problems of Information Transmission | 2020-06-23 | Paper |
Automated synthesis of application-layer connectors from automata-based specifications
Journal of Computer and System Sciences | 2019-06-25 | Paper |
If a DOL language is k-power free then it is circular
Automata, Languages and Programming | 2019-03-29 | Paper |
The expressibility of languages and relations by word equations
Automata, Languages and Programming | 2018-07-04 | Paper |
On optimal parsing for LZ78-like compressors
Theoretical Computer Science | 2018-02-16 | Paper |
Minimal forbidden words and symbolic dynamics
STACS 96 | 2017-11-16 | Paper |
Abelian-square-rich words
Theoretical Computer Science | 2017-06-15 | Paper |
The longest common substring problem
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Linear-size suffix tries
Theoretical Computer Science | 2016-06-16 | Paper |
Automata and forbidden words
Information Processing Letters | 2016-06-09 | Paper |
Abelian powers and repetitions in Sturmian words
Theoretical Computer Science | 2016-05-26 | Paper |
Compressing big data: when the rate of convergence to the entropy matters
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Automated synthesis of application-layer connectors from automata-based specifications
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Words with the maximum number of abelian squares
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Note on the greedy parsing optimality for dictionary-based text compression
Theoretical Computer Science | 2014-03-13 | Paper |
Simple real-time constant-space string matching
Theoretical Computer Science | 2014-01-09 | Paper |
A new complexity function for words based on periodicity
International Journal of Algebra and Computation | 2013-07-30 | Paper |
Abelian repetitions in Sturmian words
Developments in Language Theory | 2013-06-28 | Paper |
Characteristic Sturmian words are extremal for the critical factorization theorem
Theoretical Computer Science | 2012-10-11 | Paper |
Dictionary-symbolwise flexible parsing
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Sturmian graphs and integer representations over numeration systems
Discrete Applied Mathematics | 2012-05-04 | Paper |
Simple real-time constant-space string matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Dictionary-symbolwise flexible parsing
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On lazy representations and Sturmian graphs
Implementation and Application of Automata | 2011-02-11 | Paper |
A periodicity theorem on words and applications
Lecture Notes in Computer Science | 2010-06-17 | Paper |
From Nerode's congruence to suffix automata with mismatches
Theoretical Computer Science | 2009-09-14 | Paper |
On the Suffix Automaton with Mismatches
Implementation and Application of Automata | 2008-06-10 | Paper |
Languages with mismatches
Theoretical Computer Science | 2007-10-18 | Paper |
On Sturmian graphs
Discrete Applied Mathematics | 2007-05-30 | Paper |
Word assembly through minimal forbidden words
Theoretical Computer Science | 2006-09-14 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
A multidimensional critical factorization theorem
Theoretical Computer Science | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
International Journal of Algebra and Computation | 2005-06-07 | Paper |
| scientific article; zbMATH DE number 2087238 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2051149 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2011852 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 1998341 (Why is no real title available?) | 2003-10-29 | Paper |
Periodicity, morphisms, and matrices.
Theoretical Computer Science | 2003-08-17 | Paper |
A Note on a Conjecture of Duval and Sturmian Words
RAIRO - Theoretical Informatics and Applications | 2003-07-09 | Paper |
A Note on a Conjecture of Duval and Sturmian Words
RAIRO - Theoretical Informatics and Applications | 2003-07-09 | Paper |
A Note on a Conjecture of Duval and Sturmian Words
RAIRO - Theoretical Informatics and Applications | 2003-07-09 | Paper |
The expressibility of languages and relations by word equations
Journal of the ACM | 2003-06-25 | Paper |
On a conjecture on bidimensional words.
Theoretical Computer Science | 2003-05-25 | Paper |
On Fine and Wilf's theorem for bidimensional words.
Theoretical Computer Science | 2003-01-22 | Paper |
| scientific article; zbMATH DE number 1834673 (Why is no real title available?) | 2002-11-25 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Words and forbidden factors
Theoretical Computer Science | 2002-07-15 | Paper |
Recurrence and periodicity in infinite words from local periods
Theoretical Computer Science | 2002-03-03 | Paper |
On the number of Arnoux-Rauzy words
Acta Arithmetica | 2002-02-21 | Paper |
On the expressibility of languages by word equations with a bounded number of variables
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2002-01-14 | Paper |
Forbidden words in symbolic dynamics
Advances in Applied Mathematics | 2000-11-16 | Paper |
| scientific article; zbMATH DE number 1507226 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1456957 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1408358 (Why is no real title available?) | 2000-02-29 | Paper |
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1254099 (Why is no real title available?) | 1999-02-23 | Paper |
Periodicity and the golden ratio
Theoretical Computer Science | 1999-01-12 | Paper |
Periodicities on trees
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1222602 (Why is no real title available?) | 1998-11-11 | Paper |
Some combinatorial properties of Sturmian words
Theoretical Computer Science | 1997-02-27 | Paper |
On a generalization of the \(3x+1\) problem
Journal of Number Theory | 1996-05-20 | Paper |
Sturmian morphisms and Rauzy's rules
Journal de Théorie des Nombres de Bordeaux | 1994-10-20 | Paper |
Sturmian morphisms and Rauzy's rules
Journal de Théorie des Nombres de Bordeaux | 1994-10-20 | Paper |
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
SIAM Journal on Discrete Mathematics | 1993-06-29 | Paper |
Repetitions in the Fibonacci infinite word
RAIRO - Theoretical Informatics and Applications | 1992-09-27 | Paper |
STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES
International Journal of Foundations of Computer Science | 1992-06-25 | Paper |
On the number of factors of Sturmian words
Theoretical Computer Science | 1991-01-01 | Paper |
Infinite words with linear subword complexity
Theoretical Computer Science | 1989-01-01 | Paper |
