Filippo Mignosi

Matteo Polsinelli

Matteo Spezialetti

Proceedings of the Advances in Visual Computing - 16th International Symposium, 2021

2020

Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2020

2019

Automated synthesis of application-layer connectors from automata-based specifications.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

2018

On optimal parsing for LZ78-like compressors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

2017

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Abelian-square-rich words.

[BibT_eX]

[DOI]

Gabriele Fici

Jeffrey O. Shallit

Theor. Comput. Sci., 2017

The longest common substring problem.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

2016

Abelian powers and repetitions in Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Linear-size suffix tries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Abelian Powers and Repetitions in Sturmian Words.

[BibT_eX]

[DOI]

CoRR, 2015

Compressing Big Data: When the Rate of Convergence to the Entropy Matters.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Words with the Maximum Number of Abelian Squares.

[BibT_eX]

[DOI]

Gabriele Fici

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Note on the greedy parsing optimality for dictionary-based text compression.

[BibT_eX]

[DOI]

Alessio Langiu

Theor. Comput. Sci., 2014

Compressing Big Data: when the rate of convergence to the entropy matters.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

2013

Simple real-time constant-space string matching.

[BibT_eX]

[DOI]

Dany Breslauer

Roberto Grossi

Theor. Comput. Sci., 2013

A New Complexity Function for Words Based on Periodicity.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2013

Abelian Repetitions in Sturmian Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

The Rightmost Equal-Cost Position Problem.

[BibT_eX]

[DOI]

Alessio Langiu

Proceedings of the 2013 Data Compression Conference, 2013

2012

Characteristic Sturmian words are extremal for the Critical Factorization Theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Dictionary-symbolwise flexible parsing.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Sturmian graphs and integer representations over numeration systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2010

On Lazy Representations and Sturmian Graphs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

2009

From Nerode's congruence to suffix automata with mismatches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

2008

On the Longest Common Factor Problem.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

Languages with mismatches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On Sturmian graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

On the Suffix Automaton with Mismatches.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2007

2006

Word assembly through minimal forbidden words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A multidimensional critical factorization theorem.

[BibT_eX]

[DOI]

Chiara Epifanio

Theor. Comput. Sci., 2005

Minimal Forbidden Patterns of Multi-Dimensional Shifts.

[BibT_eX]

[DOI]

Marie-Pierre Béal

Francesca Fiorenzi

Int. J. Algebra Comput., 2005

Languages with Mismatches and an Application to Approximate Indexing.

[BibT_eX]

[DOI]

Chiara Epifanio

Alessandra Gabriele

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

Sturmian Graphs and a Conjecture of Moser.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

A Trie-Based Approach for Compacting Automata.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

On Fine and Wilf's theorem for bidimensional words.

[BibT_eX]

[DOI]

Pedro V. Silva

Theor. Comput. Sci., 2003

On a conjecture on bidimensional words.

[BibT_eX]

[DOI]

Chiara Epifanio

Michel Koskas

Theor. Comput. Sci., 2003

Periodicity, morphisms, and matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Computing forbidden words of regular languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Indexing Structures for Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Words and forbidden factors.

[BibT_eX]

[DOI]

Marinella Sciortino

Theor. Comput. Sci., 2002

A Note on a Conjecture of Duval and Sturmian Words.

[BibT_eX]

[DOI]

Luca Q. Zamboni

RAIRO Theor. Informatics Appl., 2002

2001

Recurrence and periodicity in infinite words from local periods.

[BibT_eX]

[DOI]

Jean-Pierre Duval

Theor. Comput. Sci., 2001

Forbidden Factors and Fragment Assembly.

[BibT_eX]

[DOI]

Marinella Sciortino

RAIRO Theor. Informatics Appl., 2001

Variations on a Theorem of Fine & Wilf.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Ming-wei Wang

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Data compression using antidictionaries.

[BibT_eX]

[DOI]

Proc. IEEE, 2000

The expressibility of languages and relations by word equations.

[BibT_eX]

[DOI]

Juhani Karhumäki

Wojciech Plandowski

J. ACM, 2000

Forbidden Words in Symbolic Dynamics.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2000

1999

Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words.

[BibT_eX]

[DOI]

Maria Gabriella Castelli

Theor. Comput. Sci., 1999

Text Compression Using Antidictionaries.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

Forbidden Factors in Finite and Infinite Words.

[BibT_eX]

Marinella Sciortino

Proceedings of the Jewels are Forever, 1999

1998

Periodicity and the Golden Ratio.

[BibT_eX]

[DOI]

Sergio Salemi

Theor. Comput. Sci., 1998

Periodicities on Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Automata and Forbidden Words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Minimal Forbidden Words and Factor Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

A lower bound for a constant in Shallit's conjecture.

[BibT_eX]

Juhani Karhumäki

Wojciech Plandowski

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996

Minimal Forbidden Words and Symbolic Dynamics.

[BibT_eX]

[DOI]

Marie-Pierre Béal

Proceedings of the STACS 96, 1996

1995

A Periodicity Theorem on Words and Applications.

[BibT_eX]

[DOI]

Sergio Salemi

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Some Combinatorial Properties of Sturmian Words.

[BibT_eX]

[DOI]

Aldo de Luca

Theor. Comput. Sci., 1994

A Periodicity Theorem for Trees.

[BibT_eX]

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Generalizations of the Periodicity Theorem of Fine and Wilf.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Proceedings of the Trees in Algebra and Programming, 1994

1993

Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups.

[BibT_eX]

[DOI]

Antonio Machi