Skip to main content
Passa alla visualizzazione normale.


Pari opportunità

ANTONIO RESTIVO

Curriculum and Research

RESTIVO ANTONIO

ANTONIO RESTIVO

 

Matematica e Informatica

Contacts

+3909123891102

antonio.restivo@unipa.it

Download the curriculum in pdf file

Publications

Date Title Type Record
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 A new class of string transformations for compressed text indexing Articolo in rivista Go to
2022 String Attractors and Infinite Words Contributo in atti di convegno pubblicato in volume Go to
2021 Primitive sets of words Articolo in rivista Go to
2019 Minimal forbidden factors of circular words Articolo in rivista Go to
2019 On Sets of Words of Rank Two Contributo in atti di convegno pubblicato in volume Go to
2018 Anti-powers in infinite words Articolo in rivista Go to
2018 Block Sorting-Based Transformations on Words: Beyond the Magic BWT Contributo in atti di convegno pubblicato in volume Go to
2017 Minimal forbidden factors of circular words Capitolo o Saggio Go to
2017 On the decomposition of prefix codes Articolo in rivista Go to
2016 Anti-powers in infinite words Capitolo o Saggio Go to
2015 Words Capitolo o Saggio Go to
2015 The Shuffle Product: New Research Directions Capitolo o Saggio Go to
2014 Suffix array and Lyndon factorization of a text Articolo in rivista Go to
2014 SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET Articolo in rivista Go to
2013 Sorting suffixes of a text via its Lyndon factorization Contributo in atti di convegno pubblicato in volume Go to
2013 A New Complexity Function for Words Based on Periodicity Articolo in rivista Go to
2012 Characteristic Sturmian words are extremal for the Critical Factorization Theorem Articolo in rivista Go to
2012 A note on Sturmian words Articolo in rivista Go to
2012 On the product of balanced sequences Articolo in rivista Go to
2012 A graph theoretic approach to automata minimality Articolo in rivista Go to
2012 On the Shuffle of Star-Free Languages Articolo in rivista Go to
2012 Nondeterministic Moore automata and Brzozowski's minimization algorithm Articolo in rivista Go to
2012 Dictionary-symbolwise flexible parsing Articolo in rivista Go to
2012 Extremal minimality conditions on automata Articolo in rivista Go to
2012 A bijection between words and multisets of necklaces Articolo in rivista Go to
2011 Nondeterministic Moore Automata and Brzozowski's Algorithm Proceedings Go to
2011 Hopcroft's algorithm and tree-like automata Articolo in rivista Go to
2011 Dictionary-Symbolwise Flexible Parsing Proceedings Go to
2011 Some Remarks on Automata Minimality Capitolo o Saggio Go to
2010 On Extremal Cases of the Hopcroft's Algorithm Articolo in rivista Go to
2010 Balance Properties and Distribution of Squares in Circular Words Articolo in rivista Go to
2010 The expressive power of the shuffle product Articolo in rivista Go to
2010 Automata with Extremal Minimality Conditions Proceedings Go to
2009 Circular sturmian words and Hopcroft's algorithm Articolo in rivista Go to
2009 Balanced Words Having Simple Burrows-Wheeler Transform Proceedings Go to
2009 Hopcroft’s Algorithm and Tree-like Automata Altro Go to
2009 Burrows-Wheeler transform and palindromic richness Articolo in rivista Go to
2009 On Balancing of a Direct Product Altro Go to
2009 On Extremal Cases of Hopcroft’s Algorithm Capitolo o Saggio Go to
2009 Coding partitions of regular sets Articolo in rivista Go to
2008 Hopcroft’s Algorithm and Cyclic Automata Capitolo o Saggio Go to
2008 Matrix-based complexity functions and recognizable picture languages Capitolo o Saggio Go to
2008 An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid Articolo in rivista Go to
2008 Distance measures for biological sequences: some recent approaches Articolo in rivista Go to
2008 A New Combinatorial Approach to Sequence Comparison Articolo in rivista Go to
2008 Ambiguity and Complementation in Recognizable Two-dimensional Languages Proceedings Go to
2008 Balance Properties and Distribution of Squares in Circular Words Capitolo o Saggio Go to
2007 Coding partitions: regularity, maximality and global ambiguity Proceedings Go to
2007 Circular words and automata minimization Proceedings Go to
2007 Varieties of codes and Kraft inequality Articolo in rivista Go to
2007 Combinatorial aspects of L-convex polyominoes Articolo in rivista Go to
2007 From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization Articolo in rivista Go to
2007 Tomographical aspects of L-convex polyominoes Articolo in rivista Go to
2007 An extension of the Burrows-Wheeler Transform Articolo in rivista Go to
2007 Coding Partitions Articolo in rivista Go to
2007 Languages with mismatches 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
2006 An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid Proceedings Go to
2006 Preface Curatela Go to
2006 Word assembly through minimal forbidden words Articolo in rivista Go to
2006 Unambiguous recognizable two-dimensional languages Articolo in rivista Go to
2006 Highmann's Theorem on Discrete Sets Articolo in rivista Go to
2006 Regular coding partitions Proceedings Go to
2005 An extension of the Burrows Wheeler Transform and applications to sequence comparison and data compression Capitolo o Saggio Go to
2005 Lecture Notes in Computer Science - Proc. of DLT 2005 Proceedings Go to
2005 Ordering and Convex Polyominoes Proceedings Go to
2005 Enumeration of L-convex polyominoes by rows and columns Articolo in rivista Go to
2005 Metodo per la indicizzazione approssimata e il reperimento di sequenze che si ripetono all'interno di sequenze Brevetto Go to
2005 A new sequence distance measure based on the Burrows-Wheeler Transform Proceedings Go to
2005 A New Combinatorial Approach to Sequence Comparison Capitolo o Saggio Go to
2005 A Tomographical Characterization of L-convex Polyominoes Proceedings Go to
2005 The Burrows-Wheeler Transform: a new tool in Combinatorics on Words Proceedings Go to
2005 Varieties of codes and Kraft inequality Articolo in rivista Go to
2005 Combinatorics on Words Articolo in rivista Go to
2005 The Burrows-Wheeler Transform: from data compression to combinatorics on words Proceedings Go to
2005 An extension of the Burrows-Wheeler Transform to k words Proceedings Go to
2004 On the trace product and some families of languages closed under partial commutation Articolo in rivista Go to
2004 Enumeration of L-convex polyominoes II. Bijection and area Altro Go to
2004 Patterns in words and languages Articolo in rivista Go to
2004 Enumeration of L-convex polyominoes Altro Go to
2004 Approximate string matching: indexing and the k-mismatch problem Altro Go to
2004 Comparing Sequences by the Burrows-Wheeler Transform Proceedings Go to
2004 Fragment assembly through minimal forbidden words Proceedings Go to
2003 Reconstruction of L-convex Polyominoes. Proceedings Go to