Antonio Restivo

Affiliations:
  • University of Palermo, Italy


According to our database1, Antonio Restivo authored at least 155 papers between 1973 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A New Class of String Transformations for Compressed Text Indexing.
CoRR, 2022

2021
A combinatorial view on string attractors.
Theor. Comput. Sci., 2021

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

Decidable problems in substitution shifts.
CoRR, 2021

Recognizability of morphisms.
CoRR, 2021

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

Unambiguously coded systems.
CoRR, 2021

Reducing the Local Alphabet Size in Tiling Systems for Picture Languages.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Reducing Local Alphabet Size in Recognizable Picture Languages.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020
The Alternating BWT: An algorithmic perspective.
Theor. Comput. Sci., 2020

Aldo de Luca (1941-2018).
Theor. Comput. Sci., 2020

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

2019
Minimal forbidden factors of circular words.
Theor. Comput. Sci., 2019

On generalized Lyndon words.
Theor. Comput. Sci., 2019

Aldo de Luca (1941 - 2018).
Bull. EATCS, 2019

Some variations on Lyndon words.
CoRR, 2019

String Attractors and Combinatorics on Words.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

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

Some Variations on Lyndon Words (Invited Talk).
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Anti-powers in infinite words.
J. Comb. Theory, Ser. A, 2018

Birecurrent sets.
Int. J. Algebra Comput., 2018

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

Block Sorting-Based Transformations on Words: Beyond the Magic BWT.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Measuring the clustering effect of BWT via RLE.
Theor. Comput. Sci., 2017

On the decomposition of prefix codes.
Theor. Comput. Sci., 2017

On Fixed Points of the Burrows-Wheeler Transform.
Fundam. Informaticae, 2017

Recurrent and birecurrent sets.
CoRR, 2017

Burrows-Wheeler Transform and Run-Length Enconding.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2015
The Shuffle Product: New Research Directions.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Suffix array and Lyndon factorization of a text.
J. Discrete Algorithms, 2014

Sorting conjugates and Suffixes of Words in a Multiset.
Int. J. Found. Comput. Sci., 2014

2013
A New Complexity Function for Words Based on Periodicity.
Int. J. Algebra Comput., 2013

Sorting Suffixes of a Text via its Lyndon Factorization.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Suffixes, Conjugates and Lyndon Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Extremal minimality conditions on automata.
Theor. Comput. Sci., 2012

A graph theoretic approach to automata minimality.
Theor. Comput. Sci., 2012

A note on Sturmian words.
Theor. Comput. Sci., 2012

Characteristic Sturmian words are extremal for the Critical Factorization Theorem.
Theor. Comput. Sci., 2012

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

Dictionary-symbolwise flexible parsing.
J. Discrete Algorithms, 2012

On the product of balanced sequences.
RAIRO Theor. Informatics Appl., 2012

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

A bijection between words and multisets of necklaces.
Eur. J. Comb., 2012

2011
Balancing and clustering of words in the Burrows-Wheeler transform.
Theor. Comput. Sci., 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

Some Remarks on Automata Minimality.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

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

Balance Properties and Distribution of Squares in Circular Words.
Int. J. Found. Comput. Sci., 2010

The expressive power of the shuffle product.
Inf. Comput., 2010

Automata with Extremal Minimality Conditions.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Burrows-Wheeler transform and palindromic richness.
Theor. Comput. Sci., 2009

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

Coding Partitions of Regular Sets.
Int. J. Algebra Comput., 2009

On Balancing of a Direct Product.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Balanced Words Having Simple Burrows-Wheeler Transform.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
A New Combinatorial Approach to Sequence Comparison.
Theory Comput. Syst., 2008

An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid.
RAIRO Theor. Informatics Appl., 2008

Distance measures for biological sequences: Some recent approaches.
Int. J. Approx. Reason., 2008

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

Ambiguity and Complementation in Recognizable Two-dimensional Languages.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Matrix-based complexity functions and recognizable picture languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
An extension of the Burrows-Wheeler Transform.
Theor. Comput. Sci., 2007

From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization.
Theor. Comput. Sci., 2007

Languages with mismatches.
Theor. Comput. Sci., 2007

Varieties of Codes and Kraft Inequality.
Theory Comput. Syst., 2007

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

Coding Partitions.
Discret. Math. Theor. Comput. Sci., 2007

Coding Partitions: Regularity, Maximality and Global Ambiguity.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

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

2006
Word assembly through minimal forbidden words.
Theor. Comput. Sci., 2006

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

Unambiguous recognizable two-dimensional languages.
RAIRO Theor. Informatics Appl., 2006

Preface.
Int. J. Found. Comput. Sci., 2006

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

2005
Preface.
Theor. Comput. Sci., 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

An Extension of the Burrows Wheeler Transform to k Words.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
On the Trace Product and some Families of Languages Closed under Partial Commutations.
J. Autom. Lang. Comb., 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
On Fine and Wilf's theorem for bidimensional words.
Theor. Comput. Sci., 2003

Burrows-Wheeler transform and Sturmian words.
Inf. Process. Lett., 2003

Computing forbidden words of regular languages.
Fundam. Informaticae, 2003

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

Periodicity vectors for labelled trees.
Discret. Appl. Math., 2003

Indexing Structures for Approximate String Matching.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
On the lattice of prefix codes.
Theor. Comput. Sci., 2002

Words and forbidden factors.
Theor. Comput. Sci., 2002

Binary Patterns in Infinite Binary Words.
Proceedings of the Formal and Natural Computing, 2002

2001
Codes and equations on trees.
Theor. Comput. Sci., 2001

Recurrence and periodicity in infinite words from local periods.
Theor. Comput. Sci., 2001

Forbidden Factors and Fragment Assembly.
RAIRO Theor. Informatics Appl., 2001

Words and Patterns.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Data compression using antidictionaries.
Proc. IEEE, 2000

Forbidden Words in Symbolic Dynamics.
Adv. Appl. Math., 2000

1999
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words.
Theor. Comput. Sci., 1999

Extending Formal Language Hierarchies to Higher Dimensions.
ACM Comput. Surv., 1999

Text Compression Using Antidictionaries.
Proceedings of the Automata, 1999

Forbidden Factors in Finite and Infinite Words.
Proceedings of the Jewels are Forever, 1999

1998
Periodicity and the Golden Ratio.
Theor. Comput. Sci., 1998

Periodicities on Trees.
Theor. Comput. Sci., 1998

Automata and Forbidden Words.
Inf. Process. Lett., 1998

Minimal Forbidden Words and Factor Automata.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Two-Dimensional Languages.
Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

Tree Codes and Equations.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
On Languages Factorizing the Free Monoid.
Int. J. Algebra Comput., 1996

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems.
Inf. Comput., 1996

Two-Dimensional Finite State Recognizability.
Fundam. Informaticae, 1996

Minimal Forbidden Words and Symbolic Dynamics.
Proceedings of the STACS 96, 1996

Equations on Trees.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
A Periodicity Theorem on Words and Applications.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
On the Star Height of Rational Languages.
Int. J. Algebra Comput., 1994

Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.
Proceedings of the STACS 94, 1994

A Periodicity Theorem for Trees.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Factorizing Languages.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1992
A Note on Renewal Systems.
Theor. Comput. Sci., 1992

Star-Free Trace Languages.
Theor. Comput. Sci., 1992

Recognizable Picture Languages.
Int. J. Pattern Recognit. Artif. Intell., 1992

1991
On Aperiodic Trace Languages.
Proceedings of the STACS 91, 1991

1990
Codes and Local Constraints.
Theor. Comput. Sci., 1990

Complete subgraphs of bipartite graphs and applications to trace languages.
RAIRO Theor. Informatics Appl., 1990

1989
A note on multiset decipherable codes.
IEEE Trans. Inf. Theory, 1989

Finitely Generated Sofic Systems.
Theor. Comput. Sci., 1989

Completing Codes.
RAIRO Theor. Informatics Appl., 1989

1988
Codes and Automata.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1986
Star-Free Sets of Integers.
Theor. Comput. Sci., 1986

On a generalization of a conjecture of Ehrenfeucht.
Bull. EATCS, 1986

1985
Rational Languages and the Burnside Problem.
Theor. Comput. Sci., 1985

Some Results On Finite Maximal Codes.
RAIRO Theor. Informatics Appl., 1985

1984
On Cancellation Properties of Languages which are Supports of Ration Power Series.
J. Comput. Syst. Sci., 1984

Representations lf Integers and Language Theory.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Overlap-free words on two symbols.
Proceedings of the Automata on Infinite Words, 1984

Cancellation, Pumping and Permutation in Formal Languages.
Proceedings of the Automata, 1984

1983
On the Centers of a Language.
Theor. Comput. Sci., 1983

Some Applications of a Theorem of Shirshov to Language Theory
Inf. Control., 1983

On weakly square free words.
Bull. EATCS, 1983

1981
A Family of Codes Commutatively Equivalent to Prefix Codes.
Inf. Process. Lett., 1981

1980
A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup
Inf. Control., March, 1980

On Some Properties of Very Pure Codes.
Theor. Comput. Sci., 1980

Minimal Complete Sets of Words.
Theor. Comput. Sci., 1980

On Some Properties of Local Testability.
Proceedings of the Automata, 1980

1979
Synchronization and simplification.
Discret. Math., 1979

Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978
Some Decision Results for Recognizable Sets in Arbitrary Monoids.
Proceedings of the Automata, 1978

1977
Mots Sans Répétitions et Langages Rationnels Bornés.
RAIRO Theor. Informatics Appl., 1977

Une Caractérisation des Langages Algébriques Bornés.
RAIRO Theor. Informatics Appl., 1977

On codes having no finite completions.
Discret. Math., 1977

1976
On a Family of Codes Related to Factorization of Cyclotomic Polynomials.
Proceedings of the Third International Colloquium on Automata, 1976

1975
A Combinatorial Property of Codes Having Finite Synchronization Delay.
Theor. Comput. Sci., 1975

A characterization of bounded regular sets.
Proceedings of the Automata Theory and Formal Languages, 1975

1974
On a Question of McNaughton and Papert
Inf. Control., May, 1974

1973
Codes and aperiodic languages.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973


  Loading...