Skip to main content
Passa alla visualizzazione normale.


GIUSEPPA CASTIGLIONE

Curriculum and Research

CASTIGLIONE GIUSEPPA

GIUSEPPA CASTIGLIONE

 (INF/01)

Matematica e Informatica

Subjects

Academic Year Subject identification code Subject name ECTS Course of study
2019/2020 16671 INFORMATICA TEORICA 9 INFORMATICA

Publications

Date Title Type Record
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 An Efficient Algorithm for the Generation of Z-Convex Polyominoes Proceedings (TIPOLOGIA NON ATTIVA) Go to
2014 Epichristoffel Words and Minimization of Moore Automata Articolo in rivista Go to
2014 On the Exhaustive Generation of k-Convex Polyominoes Proceedings (TIPOLOGIA NON ATTIVA) Go to
2013 Words, Trees and Automata Minimization Proceedings (TIPOLOGIA NON ATTIVA) Go to
2012 Moore Automata and Epichristoffel Words Proceedings (TIPOLOGIA NON ATTIVA) 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
2011 Hopcroft's algorithm and tree-like automata Articolo in rivista Go to
2011 A challenging family of automata for classical minimization algorithms Proceedings (TIPOLOGIA NON ATTIVA) Go to
2011 Nondeterministic Moore Automata and Brzozowski's Algorithm Proceedings (TIPOLOGIA NON ATTIVA) Go to
2010 On Extremal Cases of the Hopcroft's Algorithm Articolo in rivista Go to
2009 Circular sturmian words and Hopcroft's algorithm Articolo in rivista Go to
2009 On Extremal Cases of Hopcroft’s Algorithm Capitolo o Saggio Go to
2009 Hopcroft’s Algorithm and Tree-like Automata Altro Go to
2008 Hopcroft’s Algorithm and Cyclic Automata Capitolo o Saggio Go to
2007 Circular words and automata minimization Proceedings (TIPOLOGIA NON ATTIVA) Go to
2007 Combinatorial aspects of L-convex polyominoes Articolo in rivista Go to
2007 Recognizable Picture Languages and Polyominoes Articolo in rivista Go to
2007 Tomographical aspects of L-convex polyominoes Articolo in rivista Go to
2006 L-convex Polyominoes: A Survey Capitolo o Saggio Go to
2006 Highmann's Theorem on Discrete Sets Articolo in rivista Go to
2006 A reconstruction algorithm for L-convex polyominoes Articolo in rivista Go to
2005 Ordering and Convex Polyominoes Proceedings (TIPOLOGIA NON ATTIVA) Go to
2005 A Tomographical Characterization of L-convex Polyominoes Proceedings (TIPOLOGIA NON ATTIVA) Go to
2005 Enumeration of L-convex polyominoes by rows and columns Articolo in rivista Go to
2004 Patterns in words and languages Articolo in rivista Go to
2004 Enumeration of L-convex polyominoes Altro Go to
2004 Enumeration of L-convex polyominoes II. Bijection and area Altro Go to
2003 Reconstruction of L-convex Polyominoes. Proceedings (TIPOLOGIA NON ATTIVA) Go to