2017
On Christoffel and standard words and their derivatives.
Theor. Comput. Sci., 2017
2016
On some variations of coloring problems of infinite words.
J. Comb. Theory A, 2016
On prefixal factorizations of words.
Eur. J. Comb., 2016
2015
Sturmian words and the Stern sequence.
Theor. Comput. Sci., 2015
2014
A coloring problem for infinite words.
J. Comb. Theory A, 2014
2013
Some extremal Properties of the Fibonacci Word.
Int. J. Algebra Comput., 2013
A Coloring Problem for Sturmian and Episturmian Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
2012
A generalized palindromization map in free monoids.
Theor. Comput. Sci., 2012
A standard correspondence on epicentral words.
Eur. J. Comb., 2012
2010
On graphs of central episturmian words.
Theor. Comput. Sci., 2010
On the number of episturmian palindromes.
Theor. Comput. Sci., 2010
Involutions of epicentral words.
Eur. J. Comb., 2010
2009
Characteristic morphisms of generalized episturmian words.
Theor. Comput. Sci., 2009
On theta-episturmian words.
Eur. J. Comb., 2009
A palindromization map in free monoids.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009
Rich and Periodic-Like Words.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009
2008
Rich, Sturmian, and trapezoidal words.
Theor. Comput. Sci., 2008
On different generalizations of episturmian words.
Theor. Comput. Sci., 2008
On some problems related to palindrome closure.
RAIRO Theor. Informatics Appl., 2008
On an involution of Christoffel words and Sturmian morphisms.
Eur. J. Comb., 2008
On a Generalization of Standard Episturmian Morphisms.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008
2007
Farey codes and languages.
Eur. J. Comb., 2007
2006
Some characterizations of finite Sturmian words.
Theor. Comput. Sci., 2006
Pseudopalindrome closure operators in free monoids.
Theor. Comput. Sci., 2006
Combinatorial Properties of Sturmian Palindromes.
Int. J. Found. Comput. Sci., 2006
2005
Theor. Comput. Sci., 2005
Codes of central Sturmian words.
Theor. Comput. Sci., 2005
Completions in measure of languages and related combinatorial problems.
Theor. Comput. Sci., 2005
Some decompositions of Bernoulli sets and codes.
RAIRO Theor. Informatics Appl., 2005
Palindromes in Sturmian Words.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005
Central Sturmian Words: Recent Developments.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005
2004
Repetitions, Fullness, And Uniformity In Two-Dimensional Words.
Int. J. Found. Comput. Sci., 2004
Harmonic and gold Sturmian words.
Eur. J. Comb., 2004
2003
Semiperiodic words and root-conjugacy.
Theor. Comput. Sci., 2003
2002
Some combinatorial results on Bernoulli sets and codes.
Theor. Comput. Sci., 2002
On the distribution of characteristic parameters of words II.
RAIRO Theor. Informatics Appl., 2002
On the distribution of characteristic parameters of words.
RAIRO Theor. Informatics Appl., 2002
A combinatorial property of the factor poset of a word.
Inf. Process. Lett., 2002
Words, univalent factors, and boxes.
Acta Informatica, 2002
A Survey of Some Quantitative Approaches to the Notion of Information.
Proceedings of the Formal and Natural Computing, 2002
2001
Words and special factors.
Theor. Comput. Sci., 2001
Special Factors and Uniqueness Conditions in Rational Trees.
Theory Comput. Syst., 2001
Periodic-like words, periodicity, and boxes.
Acta Informatica, 2001
2000
Special Factors, Periodicity, and an Application to Sturmian Words.
Acta Informatica, 2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
1999
Finiteness and Regularity in Semigroups and Formal Languages
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-59849-4, 1999
On the Combinatorics of Finite Words.
Theor. Comput. Sci., 1999
Special factors in some combinational structures.
Proceedings of the Developments in Language Theory, 1999
Repetitions and Boxes in Words and Pictures.
Proceedings of the Jewels are Forever, 1999
1998
A Conjecture on Continued Fractions.
Theor. Comput. Sci., 1998
1997
Regularity and Finiteness Conditions.
Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997
Sturmian Words: Structure, Combinatorics, and Their Arithmetics.
Theor. Comput. Sci., 1997
Standard Sturmian Morphisms.
Theor. Comput. Sci., 1997
Sturmian Words, Lyndon Words and Trees.
Theor. Comput. Sci., 1997
Combinatories of Standard Sturmian Words.
Proceedings of the Structures in Logic and Computer Science, 1997
1995
A Division Property of the Fibonacci Word.
Inf. Process. Lett., 1995
1994
Some Combinatorial Properties of Sturmian Words.
Theor. Comput. Sci., 1994
On Bispecial Factors of the Thue-Morse Word.
Inf. Process. Lett., 1994
Well Quasi-Orders and Regular Languages.
Acta Informatica, 1994
On a Conjecture of Brzozowski.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
1992
On Noncounting Regular Classes.
Theor. Comput. Sci., 1992
On Finitely Recognizable Semigroups.
Acta Informatica, 1992
Some Regularity Conditions Based on Well Quasi-Orders.
Proceedings of the LATIN '92, 1992
1991
Finiteness and Iteration Conditions for Semigroups.
Theor. Comput. Sci., 1991
Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups.
Int. J. Algebra Comput., 1991
1990
Non-Repetitive Words Relative to a Rewriting System.
Theor. Comput. Sci., 1990
A combinatorial theorem on p-power-free words and an application to semigroups.
RAIRO Theor. Informatics Appl., 1990
On Non-Counting Regular Classes.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
1989
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups.
Theor. Comput. Sci., 1989
Factorial Languages Whose Growth Function is Quadratically Upper Bounded.
Inf. Process. Lett., 1989
A positive pumping condition for regular sets.
Bull. EATCS, 1989
1988
On the Factors of the Thue-Morse Word on Three Symbols.
Inf. Process. Lett., 1988
Test Sets for Languages of Infinite Words.
Inf. Process. Lett., 1988
A finiteness condition for semigroups.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988
1986
Star-Free Sets of Integers.
Theor. Comput. Sci., 1986
Square-Free Words on Partially Commutative Free Monoids.
Inf. Process. Lett., 1986
On a generalization of a conjecture of Ehrenfeucht.
Bull. EATCS, 1986
A decision procedure on partially commutative free monoids.
Discret. Appl. Math., 1986
1984
On the product of square-free words.
Discret. Math., 1984
Representations lf Integers and Language Theory.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
1983
On the Centers of a Language.
Theor. Comput. Sci., 1983
1982
On some combinatorial problems in free monoids.
Discret. Math., 1982
1981
A Combinatorial Property of the Fibonacci Words.
Inf. Process. Lett., 1981
1980
A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup
Inf. Control., March, 1980
On Some Properties of Very Pure Codes.
Theor. Comput. Sci., 1980
Minimal Complete Sets of Words.
Theor. Comput. Sci., 1980
On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup.
RAIRO Theor. Informatics Appl., 1980
On Some Properties of Local Testability.
Proceedings of the Automata, 1980
1979
Synchronization and simplification.
Discret. Math., 1979
Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979
1978
A Combinatorial Property of Finite Prefix Codes
Inf. Control., June, 1978
1977
Measures of Ambiguity in the Analysis of Complex Systems.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977
1976
A Note on Variable Length Codes
Inf. Control., November, 1976
1975
On the entropy of a formal language.
Proceedings of the Automata Theory and Formal Languages, 1975
1974
Inf. Control., January, 1974
1973
Fuzzy Sets and Decision Theory
Inf. Control., December, 1973
1972
A Definition of a Nonprobabilistic Entropy in the Setting of Fuzzy Sets Theory
Inf. Control., May, 1972
