Giusi Castiglione

Orcid: 0000-0002-1838-9785

According to our database1, Giusi Castiglione authored at least 37 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Characterization of Isometric Words based on Swap and Mismatch Distance.
CoRR, 2024

Isometric Sets of Words and Generalizations of the Fibonacci Cubes.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Hypercubes and Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

Isometric Words and Edit Distance: Main Notions and New Variations.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2023

2022
The intersection of 3-maximal submonoids.
Theor. Comput. Sci., 2022

2021
Primitive sets of words.
Theor. Comput. Sci., 2021

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

2020
Some Investigations on Similarity Measures Based on Absent Words.
Fundam. Informaticae, 2020

The Intersection of 3-Maximal Submonids.
CoRR, 2020

2019
On Sets of Words of Rank Two.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

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

2017
On a class of languages with holonomic generating functions.
Theor. Comput. Sci., 2017

On the exhaustive generation of k-convex polyominoes.
Theor. Comput. Sci., 2017

2015
Standard Sturmian words and automata minimization algorithms.
Theor. Comput. Sci., 2015

On Computing the Degree of Convexity of Polyominoes.
Electron. J. Comb., 2015

2014
Epichristoffel Words and Minimization of Moore Automata.
Fundam. Informaticae, 2014

An Efficient Algorithm for the Generation of Z-Convex Polyominoes.
Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

2013
Words, Trees and Automata Minimization.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Nondeterministic Moore automata and Brzozowski's minimization algorithm.
Theor. Comput. Sci., 2012

On the Shuffle of Star-Free Languages.
Fundam. Informaticae, 2012

2011
Hopcroft's algorithm and tree-like automata.
RAIRO Theor. Informatics Appl., 2011

Nondeterministic Moore Automata and Brzozowski's Algorithm.
Proceedings of the Implementation and Application of Automata, 2011

2010
On extremal cases of Hopcroft's algorithm.
Theor. Comput. Sci., 2010

A Challenging Family of Automata for Classical Minimization Algorithms.
Proceedings of the Implementation and Application of Automata, 2010

2009
Circular sturmian words and Hopcroft's algorithm.
Theor. Comput. Sci., 2009

2008
Hopcroft's Algorithm and Cyclic Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
Combinatorial aspects of L-convex polyominoes.
Eur. J. Comb., 2007

Recognizable Picture Languages and Polyominoes.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

L-Convex Polyominoes: A Survey.
Proceedings of the Formal Models, 2007

2006
A reconstruction algorithm for L-convex polyominoes.
Theor. Comput. Sci., 2006

Higman's Theorem on Discrete Sets.
Fundam. Informaticae, 2006

2005
Enumeration of L-convex polyominoes by rows and columns.
Theor. Comput. Sci., 2005

A Tomographical Characterization of L-Convex Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004
Patterns in words and languages.
Discret. Appl. Math., 2004

Ordering and Convex Polyominoes.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
Reconstruction of L-convex Polyominoes.
Electron. Notes Discret. Math., 2003


  Loading...