2024 |
Isometric Sets of Words and Generalizations of the Fibonacci Cubes |
Contributo in atti di convegno pubblicato in volume |
Go to |
2024 |
A Comparison Between Similarity Measures Based on Minimal Absent Words: An Experimental Approach |
Contributo in atti di convegno pubblicato in volume |
Go to |
2023 |
Isometric Words and Edit Distance: Main Notions and New Variations |
Contributo in atti di convegno pubblicato in volume |
Go to |
2023 |
Hypercubes and Isometric Words Based on Swap and Mismatch Distance |
Contributo in atti di convegno pubblicato in volume |
Go to |
2023 |
Isometric Words Based on Swap and Mismatch Distance |
Contributo in atti di convegno pubblicato in volume |
Go to |
2023 |
Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023 |
Curatela |
Go to |
2022 |
The intersection of 3-maximal submonoids |
Articolo in rivista |
Go to |
2021 |
Primitive sets of words |
Articolo in rivista |
Go to |
2019 |
On Sets of Words of Rank Two |
Contributo in atti di convegno pubblicato in volume |
Go to |
2019 |
Some Investigations on Similarity Measures Based on Absent Words |
Articolo in rivista |
Go to |
2017 |
On the Exhaustive Generation of k-Convex Polyominoes |
Contributo in atti di convegno pubblicato in rivista |
Go to |
2017 |
On a class of languages with holonomic generating functions |
Articolo in rivista |
Go to |
2017 |
On the exhaustive generation of k-convex polyominoes |
Articolo in rivista |
Go to |
2015 |
On computing the degree of convexity of polyominoes |
Articolo in rivista |
Go to |
2015 |
Standard Sturmian words and automata minimization algorithms |
Articolo in rivista |
Go to |
2014 |
Epichristoffel Words and Minimization of Moore Automata |
Articolo in rivista |
Go to |
2014 |
An Efficient Algorithm for the Generation of Z-Convex Polyominoes |
Contributo in atti di convegno pubblicato in volume |
Go to |
2013 |
Words, Trees and Automata Minimization |
Contributo in atti di convegno pubblicato in volume |
Go to |
2012 |
Nondeterministic Moore automata and Brzozowski's minimization algorithm |
Articolo in rivista |
Go to |
2012 |
On the Shuffle of Star-Free Languages |
Articolo in rivista |
Go to |
2012 |
Moore Automata and Epichristoffel Words |
Proceedings |
Go to |
2011 |
A challenging family of automata for classical minimization algorithms |
Proceedings |
Go to |
2011 |
Hopcroft's algorithm and tree-like automata |
Articolo in rivista |
Go to |
2011 |
Nondeterministic Moore Automata and Brzozowski's Algorithm |
Proceedings |
Go to |
2010 |
On Extremal Cases of the Hopcroft's Algorithm |
Articolo in rivista |
Go to |
2009 |
Hopcroft’s Algorithm and Tree-like Automata |
Altro |
Go to |
2009 |
On Extremal Cases of Hopcroft’s Algorithm |
Capitolo o Saggio |
Go to |
2009 |
Circular sturmian words and Hopcroft's algorithm |
Articolo in rivista |
Go to |
2008 |
Hopcroft’s Algorithm and Cyclic Automata |
Capitolo o Saggio |
Go to |
2007 |
Tomographical aspects of L-convex polyominoes |
Articolo in rivista |
Go to |
2007 |
Recognizable picture languages and polyominoes |
Contributo in atti di convegno pubblicato in volume |
Go to |
2007 |
Circular words and automata minimization |
Proceedings |
Go to |
2007 |
Combinatorial aspects of L-convex polyominoes |
Articolo in rivista |
Go to |
2006 |
Highmann's Theorem on Discrete Sets |
Articolo in rivista |
Go to |
2006 |
L-convex Polyominoes: A Survey |
Capitolo o Saggio |
Go to |
2006 |
A reconstruction algorithm for L-convex polyominoes |
Articolo in rivista |
Go to |
2005 |
Enumeration of L-convex polyominoes by rows and columns |
Articolo in rivista |
Go to |
2005 |
A Tomographical Characterization of L-convex Polyominoes |
Proceedings |
Go to |
2005 |
Ordering and Convex Polyominoes |
Proceedings |
Go to |
2004 |
Enumeration of L-convex polyominoes |
Altro |
Go to |
2004 |
Patterns in words and languages |
Articolo in rivista |
Go to |
2004 |
Enumeration of L-convex polyominoes II. Bijection and area |
Altro |
Go to |
2003 |
Reconstruction of L-convex Polyominoes. |
Proceedings |
Go to |