Antonio Restivo

According to our database, Antonio Restivo authored at least 161 papers between 1973 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Row-Column Combination of Dyck Words.

Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

A new class of string transformations for compressed text indexing.

Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Inf. Comput., October, 2023

Two-dimensional Dyck words.

Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro

CoRR, 2023

Recognizability in S-adic shifts.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner

CoRR, 2023

Two-Dimensional Dyck Words (short paper) (text not included).

Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

Reducing the local alphabet size in tiling systems by means of 2D comma-free codes.

Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro

Theor. Comput. Sci., 2022

String Attractors and Infinite Words.

Antonio Restivo, Giuseppe Romana, Marinella Sciortino

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

A combinatorial view on string attractors.

Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino

Theor. Comput. Sci., 2021

Primitive sets of words.

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

Theor. Comput. Sci., 2021

Decidable problems in substitution shifts.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

CoRR, 2021

Recognizability of morphisms.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

CoRR, 2021

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

Giuseppa Castiglione, Jia Gao, Sabrina Mantaci, Antonio Restivo

CoRR, 2021

Unambiguously coded systems.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

CoRR, 2021

Reducing the Local Alphabet Size in Tiling Systems for Picture Languages.

Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Reducing Local Alphabet Size in Recognizable Picture Languages.

Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020

The Alternating BWT: An algorithmic perspective.

Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Theor. Comput. Sci., 2020

Aldo de Luca (1941-2018).

Clelia De Felice, Dominique Perrin, Antonio Restivo

Theor. Comput. Sci., 2020

Some Investigations on Similarity Measures Based on Absent Words.

Giuseppa Castiglione, Sabrina Mantaci, Antonio Restivo

Fundam. Informaticae, 2020

2019

Minimal forbidden factors of circular words.

Gabriele Fici, Antonio Restivo, Laura Rizzo

Theor. Comput. Sci., 2019

On generalized Lyndon words.

Francesco Dolce, Antonio Restivo, Christophe Reutenauer

Theor. Comput. Sci., 2019

Aldo de Luca (1941 - 2018).

Clelia De Felice, Gabriele Fici, Antonio Restivo

Bull. EATCS, 2019

Some variations on Lyndon words.

Francesco Dolce, Antonio Restivo, Christophe Reutenauer

CoRR, 2019

String Attractors and Combinatorics on Words.

Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

On Sets of Words of Rank Two.

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Some Variations on Lyndon Words (Invited Talk).

Francesco Dolce, Antonio Restivo, Christophe Reutenauer

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Anti-powers in infinite words.

Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni

J. Comb. Theory, Ser. A, 2018

Birecurrent sets.

Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone

Int. J. Algebra Comput., 2018

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

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

CoRR, 2018

Block Sorting-Based Transformations on Words: Beyond the Magic BWT.

Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Measuring the clustering effect of BWT via RLE.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino, Luca Versari

Theor. Comput. Sci., 2017

On the decomposition of prefix codes.

Clelia De Felice, Sabrina Mantaci, Antonio Restivo

Theor. Comput. Sci., 2017

On Fixed Points of the Burrows-Wheeler Transform.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Floriana Russo, Marinella Sciortino

Fundam. Informaticae, 2017

Recurrent and birecurrent sets.

Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone

CoRR, 2017

Burrows-Wheeler Transform and Run-Length Enconding.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2015

The Shuffle Product: New Research Directions.

Antonio Restivo

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Suffix array and Lyndon factorization of a text.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

J. Discrete Algorithms, 2014

Sorting conjugates and Suffixes of Words in a Multiset.

Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Int. J. Found. Comput. Sci., 2014

2013

A New Complexity Function for Words Based on Periodicity.

Filippo Mignosi, Antonio Restivo

Int. J. Algebra Comput., 2013

Sorting Suffixes of a Text via its Lyndon Factorization.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Suffixes, Conjugates and Lyndon Words.

Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Extremal minimality conditions on automata.

Antonio Restivo, Roberto Vaglica

Theor. Comput. Sci., 2012

A graph theoretic approach to automata minimality.

Antonio Restivo, Roberto Vaglica

Theor. Comput. Sci., 2012

A note on Sturmian words.

Dominique Perrin, Antonio Restivo

Theor. Comput. Sci., 2012

Characteristic Sturmian words are extremal for the Critical Factorization Theorem.

Filippo Mignosi, Antonio Restivo

Theor. Comput. Sci., 2012

Nondeterministic Moore automata and Brzozowski's minimization algorithm.

Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2012

Dictionary-symbolwise flexible parsing.

Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo

J. Discrete Algorithms, 2012

On the product of balanced sequences.

Antonio Restivo, Giovanna Rosone

RAIRO Theor. Informatics Appl., 2012

On the Shuffle of Star-Free Languages.

Giusi Castiglione, Antonio Restivo

Fundam. Informaticae, 2012

A bijection between words and multisets of necklaces.

Ira M. Gessel, Antonio Restivo, Christophe Reutenauer

Eur. J. Comb., 2012

2011

Balancing and clustering of words in the Burrows-Wheeler transform.

Antonio Restivo, Giovanna Rosone

Theor. Comput. Sci., 2011

Hopcroft's algorithm and tree-like automata.

Giusi Castiglione, Antonio Restivo, Marinella Sciortino

RAIRO Theor. Informatics Appl., 2011

Nondeterministic Moore Automata and Brzozowski's Algorithm.

Giusi Castiglione, Antonio Restivo, Marinella Sciortino

Proceedings of the Implementation and Application of Automata, 2011

Some Remarks on Automata Minimality.

Antonio Restivo, Roberto Vaglica

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

On extremal cases of Hopcroft's algorithm.

Giusi Castiglione, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2010

Balance Properties and Distribution of Squares in Circular Words.

Roberto Mantaci, Sabrina Mantaci, Antonio Restivo

Int. J. Found. Comput. Sci., 2010

The expressive power of the shuffle product.

Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo

Inf. Comput., 2010

Automata with Extremal Minimality Conditions.

Antonio Restivo, Roberto Vaglica

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Burrows-Wheeler transform and palindromic richness.

Antonio Restivo, Giovanna Rosone

Theor. Comput. Sci., 2009

Circular sturmian words and Hopcroft's algorithm.

Giusi Castiglione, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2009

Coding Partitions of Regular Sets.

Marie-Pierre Béal, Fabio Burderi, Antonio Restivo

Int. J. Algebra Comput., 2009

On Balancing of a Direct Product.

Antonio Restivo, Giovanna Rosone

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Balanced Words Having Simple Burrows-Wheeler Transform.

Antonio Restivo, Giovanna Rosone

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

A New Combinatorial Approach to Sequence Comparison.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Theory Comput. Syst., 2008

An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid.

Laura Giambruno, Antonio Restivo

RAIRO Theor. Informatics Appl., 2008

Distance measures for biological sequences: Some recent approaches.

Sabrina Mantaci, Antonio Restivo, Marinella Sciortino

Int. J. Approx. Reason., 2008

Hopcroft's Algorithm and Cyclic Automata.

Giusi Castiglione, Antonio Restivo, Marinella Sciortino

Proceedings of the Language and Automata Theory and Applications, 2008

Ambiguity and Complementation in Recognizable Two-dimensional Languages.

Dora Giammarresi, Antonio Restivo

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Matrix-based complexity functions and recognizable picture languages.

Dora Giammarresi, Antonio Restivo

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

An extension of the Burrows-Wheeler Transform.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Theor. Comput. Sci., 2007

From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization.

Raffaele Giancarlo, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2007

Languages with mismatches.

Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2007

Varieties of Codes and Kraft Inequality.

Fabio Burderi, Antonio Restivo

Theory Comput. Syst., 2007

Combinatorial aspects of L-convex polyominoes.

Giusi Castiglione, Andrea Frosini, Emanuele Munarini, Antonio Restivo, Simone Rinaldi

Eur. J. Comb., 2007

Coding Partitions.

Fabio Burderi, Antonio Restivo

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

Coding Partitions: Regularity, Maximality and Global Ambiguity.

Marie-Pierre Béal, Fabio Burderi, Antonio Restivo

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

L-Convex Polyominoes: A Survey.

Giusi Castiglione, Antonio Restivo

Proceedings of the Formal Models, 2007

2006

Word assembly through minimal forbidden words.

Gabriele Fici, Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2006

A reconstruction algorithm for L-convex polyominoes.

Giusi Castiglione, Antonio Restivo, Roberto Vaglica

Theor. Comput. Sci., 2006

Unambiguous recognizable two-dimensional languages.

Marcella Anselmo, Dora Giammarresi, Maria Madonia, Antonio Restivo

RAIRO Theor. Informatics Appl., 2006

Preface.

Clelia de Felice, Antonio Restivo

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

Higman's Theorem on Discrete Sets.

Fabio Burderi, Giuseppa Castiglione, Antonio Restivo

Fundam. Informaticae, 2006

2005

Preface.

Tero Harju, Juhani Karhumäki, Antonio Restivo

Theor. Comput. Sci., 2005

Enumeration of L-convex polyominoes by rows and columns.

Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi

Theor. Comput. Sci., 2005

A Tomographical Characterization of L-Convex Polyominoes.

Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

An Extension of the Burrows Wheeler Transform to k Words.

Sabrina Mantaci, Antonio Restivo, Marinella Sciortino

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.

Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

On the Trace Product and some Families of Languages Closed under Partial Commutations.

Giovanna Guaiana, Antonio Restivo, Sergio Salemi

J. Autom. Lang. Comb., 2004

Patterns in words and languages.

Giusi Castiglione, Antonio Restivo, Sergio Salemi

Discret. Appl. Math., 2004

Ordering and Convex Polyominoes.

Giusi Castiglione, Antonio Restivo

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003

On Fine and Wilf's theorem for bidimensional words.

Filippo Mignosi, Antonio Restivo, Pedro V. Silva

Theor. Comput. Sci., 2003

Burrows-Wheeler transform and Sturmian words.

Sabrina Mantaci, Antonio Restivo, Marinella Sciortino

Inf. Process. Lett., 2003

Computing forbidden words of regular languages.

Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Fundam. Informaticae, 2003

Reconstruction of L-convex Polyominoes.

Giusi Castiglione, Antonio Restivo

Electron. Notes Discret. Math., 2003

Periodicity vectors for labelled trees.

Antonio Restivo, Pedro V. Silva

Discret. Appl. Math., 2003

Indexing Structures for Approximate String Matching.

Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

On the lattice of prefix codes.

Antonio Restivo, Pedro V. Silva

Theor. Comput. Sci., 2002

Words and forbidden factors.

Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2002

Binary Patterns in Infinite Binary Words.

Antonio Restivo, Sergio Salemi

Proceedings of the Formal and Natural Computing, 2002

2001

Codes and equations on trees.

Sabrina Mantaci, Antonio Restivo

Theor. Comput. Sci., 2001

Recurrence and periodicity in infinite words from local periods.

Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo

Theor. Comput. Sci., 2001

Forbidden Factors and Fragment Assembly.

Filippo Mignosi, Antonio Restivo, Marinella Sciortino

RAIRO Theor. Informatics Appl., 2001

Words and Patterns.

Antonio Restivo, Sergio Salemi

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

Data compression using antidictionaries.

Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi

Proc. IEEE, 2000

Forbidden Words in Symbolic Dynamics.

Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Adv. Appl. Math., 2000

1999

Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words.

Maria Gabriella Castelli, Filippo Mignosi, Antonio Restivo

Theor. Comput. Sci., 1999

Extending Formal Language Hierarchies to Higher Dimensions.

Dora Giammarresi, Antonio Restivo

ACM Comput. Surv., 1999

Text Compression Using Antidictionaries.

Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi

Proceedings of the Automata, 1999

Forbidden Factors in Finite and Infinite Words.

Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Proceedings of the Jewels are Forever, 1999

1998

Periodicity and the Golden Ratio.

Filippo Mignosi, Antonio Restivo, Sergio Salemi

Theor. Comput. Sci., 1998

Periodicities on Trees.

Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo

Theor. Comput. Sci., 1998

Automata and Forbidden Words.

Maxime Crochemore, Filippo Mignosi, Antonio Restivo

Inf. Process. Lett., 1998

Minimal Forbidden Words and Factor Automata.

Maxime Crochemore, Filippo Mignosi, Antonio Restivo

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Two-Dimensional Languages.

Dora Giammarresi, Antonio Restivo

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

Tree Codes and Equations.

Sabrina Mantaci, Antonio Restivo

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996

On Languages Factorizing the Free Monoid.

Marcella Anselmo, Antonio Restivo

Int. J. Algebra Comput., 1996

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems.

Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas

Inf. Comput., 1996

Two-Dimensional Finite State Recognizability.

Dora Giammarresi, Antonio Restivo

Fundam. Informaticae, 1996

Minimal Forbidden Words and Symbolic Dynamics.

Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo

Proceedings of the STACS 96, 1996

Equations on Trees.

Sabrina Mantaci, Antonio Restivo

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

A Periodicity Theorem on Words and Applications.

Filippo Mignosi, Antonio Restivo, Sergio Salemi

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

On the Star Height of Rational Languages.

Rosa Montalbano, Antonio Restivo

Int. J. Algebra Comput., 1994

Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.

Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas

Proceedings of the STACS 94, 1994

A Periodicity Theorem for Trees.

Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo

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.

Marcella Anselmo, Antonio Restivo

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.

Antonio Restivo

Theor. Comput. Sci., 1992

Star-Free Trace Languages.

Giovanna Guaiana, Antonio Restivo, Sergio Salemi

Theor. Comput. Sci., 1992

Recognizable Picture Languages.

Dora Giammarresi, Antonio Restivo

Int. J. Pattern Recognit. Artif. Intell., 1992

1991

On Aperiodic Trace Languages.

Giovanna Guaiana, Antonio Restivo, Sergio Salemi

Proceedings of the STACS 91, 1991

1990

Codes and Local Constraints.

Antonio Restivo

Theor. Comput. Sci., 1990

Complete subgraphs of bipartite graphs and applications to trace languages.

Giovanna Guaiana, Antonio Restivo, Sergio Salemi

RAIRO Theor. Informatics Appl., 1990

1989

A note on multiset decipherable codes.

Antonio Restivo

IEEE Trans. Inf. Theory, 1989

Finitely Generated Sofic Systems.

Antonio Restivo

Theor. Comput. Sci., 1989

Completing Codes.

Antonio Restivo, Sergio Salemi, Tecla Sportelli

RAIRO Theor. Informatics Appl., 1989

1988

Codes and Automata.

Antonio Restivo

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

1986

Star-Free Sets of Integers.

Aldo de Luca, Antonio Restivo

Theor. Comput. Sci., 1986

On a generalization of a conjecture of Ehrenfeucht.

Aldo de Luca, Antonio Restivo

Bull. EATCS, 1986

1985

Rational Languages and the Burnside Problem.

Antonio Restivo, Christophe Reutenauer

Theor. Comput. Sci., 1985

Some Results On Finite Maximal Codes.

Clelia de Felice, Antonio Restivo

RAIRO Theor. Informatics Appl., 1985

1984

On Cancellation Properties of Languages which are Supports of Ration Power Series.

Antonio Restivo, Christophe Reutenauer

J. Comput. Syst. Sci., 1984

Representations lf Integers and Language Theory.

Aldo de Luca, Antonio Restivo

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Overlap-free words on two symbols.

Antonio Restivo, Sergio Salemi

Proceedings of the Automata on Infinite Words, 1984

Cancellation, Pumping and Permutation in Formal Languages.

Antonio Restivo, Christophe Reutenauer

Proceedings of the Automata, 1984

1983

On the Centers of a Language.

Aldo de Luca, Antonio Restivo, Sergio Salemi

Theor. Comput. Sci., 1983

Some Applications of a Theorem of Shirshov to Language Theory

Antonio Restivo, Christophe Reutenauer

Inf. Control., 1983

On weakly square free words.

Antonio Restivo, Sergio Salemi

Bull. EATCS, 1983

1981

A Family of Codes Commutatively Equivalent to Prefix Codes.

S. Mauceri, Antonio Restivo

Inf. Process. Lett., 1981

1980

A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup

Aldo de Luca, Antonio Restivo

Inf. Control., March, 1980

On Some Properties of Very Pure Codes.

Aldo de Luca, Antonio Restivo

Theor. Comput. Sci., 1980

Minimal Complete Sets of Words.

Jean-Marie Boë, Aldo de Luca, Antonio Restivo

Theor. Comput. Sci., 1980

On Some Properties of Local Testability.

Aldo de Luca, Antonio Restivo

Proceedings of the Automata, 1980

1979

Synchronization and simplification.

Aldo de Luca, Dominique Perrin, Antonio Restivo, Settimo Termini

Discret. Math., 1979

Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup.

Aldo de Luca, Antonio Restivo

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

Some Decision Results for Recognizable Sets in Arbitrary Monoids.

Antonio Restivo

Proceedings of the Automata, 1978

1977

Mots Sans Répétitions et Langages Rationnels Bornés.

Antonio Restivo

RAIRO Theor. Informatics Appl., 1977

Une Caractérisation des Langages Algébriques Bornés.

Luc Boasson, Antonio Restivo

RAIRO Theor. Informatics Appl., 1977

On codes having no finite completions.

Antonio Restivo

Discret. Math., 1977

1976

On a Family of Codes Related to Factorization of Cyclotomic Polynomials.

Antonio Restivo

Proceedings of the Third International Colloquium on Automata, 1976

1975

A Combinatorial Property of Codes Having Finite Synchronization Delay.

Antonio Restivo

Theor. Comput. Sci., 1975

A characterization of bounded regular sets.

Antonio Restivo

Proceedings of the Automata Theory and Formal Languages, 1975

1974

On a Question of McNaughton and Papert

Antonio Restivo

Inf. Control., May, 1974

1973

Codes and aperiodic languages.

Antonio Restivo

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973