Arturo Carpi
According to our database1, Arturo Carpi
authored at least 48 papers
between 1983 and 2017.
Collaborative distances :
Collaborative distances :
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2017
On incomplete and synchronizing finite sets.
Theor. Comput. Sci., 2017
2016
On incomplete and synchronizing finite sets.
CoRR, 2016
2014
Universal Lyndon Words.
CoRR, 2014
Universal Lyndon Words.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Cerny-like problems for finite sets of words.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014
2011
Combinatorics on words.
Theor. Comput. Sci., 2011
Independent sets of words and the synchronization problem
CoRR, 2011
2010
On factors of synchronized sequences.
Theor. Comput. Sci., 2010
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010
2009
On a word avoiding near repeats.
Inf. Process. Lett., 2009
On the Repetitivity Index of Infinite Words.
IJAC, 2009
Strongly transitive automata and the Cerný conjecture.
Acta Inf., 2009
The Synchronization Problem for Locally Strongly Transitive Automata.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
Synchronizing Automata and Independent Systems of Words.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009
2008
The Synchronization Problem for Strongly Transitive Automata.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008
2007
On Dejean's conjecture over large alphabets.
Theor. Comput. Sci., 2007
Farey codes and languages.
Eur. J. Comb., 2007
2006
On the Repetition Threshold for Large Alphabets.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
2005
Codes of central Sturmian words.
Theor. Comput. Sci., 2005
Completions in measure of languages and related combinatorial problems.
Theor. Comput. Sci., 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
On the distribution of characteristic parameters of words II.
ITA, 2002
On the distribution of characteristic parameters of words.
ITA, 2002
A combinatorial property of the factor poset of a word.
Inf. Process. Lett., 2002
Words, univalent factors, and boxes.
Acta Inf., 2002
2001
Words and special factors.
Theor. Comput. Sci., 2001
Special Factors and Uniqueness Conditions in Rational Trees.
Theory Comput. Syst., 2001
On synchronized sequences and their separators.
ITA, 2001
Periodic-like words, periodicity, and boxes.
Acta Inf., 2001
2000
Special Factors, Periodicity, and an Application to Sturmian Words.
Acta Inf., 2000
Periodic-Like Words.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
1999
On Abelian Squares and Substitutions.
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
On the Number of Abelian Square-free Words on Four Letters.
Discrete Applied Mathematics, 1998
1994
On Repeated Factors in C^\infty-Words.
Inf. Process. Lett., 1994
On Representation Systems.
IJAC, 1994
1993
Overlap-Free Words and Finite Automata.
Theor. Comput. Sci., 1993
On Abelian Power-Free Morphisms.
IJAC, 1993
1990
Non-Repetitive Words Relative to a Rewriting System.
Theor. Comput. Sci., 1990
1988
On Synchronizing Unambiguous Automata.
Theor. Comput. Sci., 1988
Multidimensional Unrepetitive Configurations.
Theor. Comput. Sci., 1988
1986
Square-Free Words on Partially Commutative Free Monoids.
Inf. Process. Lett., 1986
1984
On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet.
Inf. Process. Lett., 1984
1983
On the Size of a Square-Free Morphism on a Three Letter Alphabet.
Inf. Process. Lett., 1983