Giusi Castiglione

Manuela Flores

Dora Giammarresi

Proceedings of the Cellular Automata and Discrete Complex Systems, 2023

2022

The intersection of 3-maximal submonoids.

[BibT_eX]

[DOI]

Stepan Holub

Theor. Comput. Sci., 2022

2021

Primitive sets of words.

[BibT_eX]

[DOI]

Gabriele Fici

Theor. Comput. Sci., 2021

A new distance based on minimal absent words and applications to biological sequences.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Some Investigations on Similarity Measures Based on Absent Words.

[BibT_eX]

[DOI]

Sabrina Mantaci

Fundam. Informaticae, 2020

The Intersection of 3-Maximal Submonids.

[BibT_eX]

[DOI]

Stepan Holub

CoRR, 2020

2019

On Sets of Words of Rank Two.

[BibT_eX]

[DOI]

Gabriele Fici

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

On k-Maximal Submonoids, with Applications in Combinatorics on Words.

[BibT_eX]

[DOI]

Gabriele Fici

CoRR, 2018

2017

On a class of languages with holonomic generating functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On the exhaustive generation of k-convex polyominoes.

[BibT_eX]

[DOI]

Stefano Brocchi

Theor. Comput. Sci., 2017

2015

Standard Sturmian words and automata minimization algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On Computing the Degree of Convexity of Polyominoes.

[BibT_eX]

[DOI]

Stefano Brocchi

Electron. J. Comb., 2015

2014

Epichristoffel Words and Minimization of Moore Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

An Efficient Algorithm for the Generation of Z-Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

2013

Words, Trees and Automata Minimization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Nondeterministic Moore automata and Brzozowski's minimization algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the Shuffle of Star-Free Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

2011

Hopcroft's algorithm and tree-like automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Nondeterministic Moore Automata and Brzozowski's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2011

2010

On extremal cases of Hopcroft's algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A Challenging Family of Automata for Classical Minimization Algorithms.

[BibT_eX]

[DOI]

Cyril Nicaud

Proceedings of the Implementation and Application of Automata, 2010

2009

Circular sturmian words and Hopcroft's algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

2008

Hopcroft's Algorithm and Cyclic Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Combinatorial aspects of L-convex polyominoes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Recognizable Picture Languages and Polyominoes.

[BibT_eX]

[DOI]

Roberto Vaglica

Proceedings of the Algebraic Informatics, Second International Conference, 2007

L-Convex Polyominoes: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2006

A reconstruction algorithm for L-convex polyominoes.

[BibT_eX]

[DOI]

Roberto Vaglica

Theor. Comput. Sci., 2006

Higman's Theorem on Discrete Sets.

[BibT_eX]

[DOI]

Fabio Burderi

Fundam. Informaticae, 2006

2005

Enumeration of L-convex polyominoes by rows and columns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Tomographical Characterization of L-Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004

Patterns in words and languages.

[BibT_eX]

[DOI]

Sergio Salemi

Discret. Appl. Math., 2004

Ordering and Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003

Reconstruction of L-convex Polyominoes.

[BibT_eX]

[DOI]