default search action
Antonio Restivo
Person information
- affiliation: University of Palermo, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j104]Marie-Pierre Béal
, Dominique Perrin, Antonio Restivo:
Unambiguously coded shifts. Eur. J. Comb. 119: 103812 (2024) - [j103]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Decidable problems in substitution shifts. J. Comput. Syst. Sci. 143: 103529 (2024) - [j102]Julien Cassaigne, France Gheeraert, Antonio Restivo, Giuseppe Romana
New string attractor-based complexities for infinite words. J. Comb. Theory, Ser. A 208: 105936 (2024) - [j101]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem. Theor. Comput. Sci. 1002: 114598 (2024) - [c60]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Row-Column Combination of Dyck Words. SOFSEM 2024: 139-153 - 2023
- [j100]Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino
A new class of string transformations for compressed text indexing. Inf. Comput. 294: 105068 (2023) - [c59]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Two-Dimensional Dyck Words (short paper) (text not included). ICTCS 2023 - [i19]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner:
Recognizability in S-adic shifts. CoRR abs/2302.06258 (2023) - [i18]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Two-dimensional Dyck words. CoRR abs/2307.16522 (2023) - 2022
- [j99]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes. Theor. Comput. Sci. 933: 1-20 (2022) - [c58]Antonio Restivo
String Attractors and Infinite Words. LATIN 2022: 426-442 - [i17]Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
A New Class of String Transformations for Compressed Text Indexing. CoRR abs/2205.05643 (2022) - [i16]Antonio Restivo, Giuseppe Romana, Marinella Sciortino:
String Attractors and Infinite Words. CoRR abs/2206.00376 (2022) - [i15]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes. CoRR abs/2206.05208 (2022) - 2021
- [j98]Sabrina Mantaci, Antonio Restivo, Giuseppe Romana
A combinatorial view on string attractors. Theor. Comput. Sci. 850: 236-248 (2021) - [j97]Giuseppa Castiglione, Gabriele Fici
Primitive sets of words. Theor. Comput. Sci. 866: 25-36 (2021) - [c57]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing Local Alphabet Size in Recognizable Picture Languages. DLT 2021: 103-116 - [c56]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the Local Alphabet Size in Tiling Systems for Picture Languages. ICTCS 2021: 199-204 - [i14]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Unambiguously coded systems. CoRR abs/2103.01012 (2021) - [i13]Giuseppa Castiglione, Jia Gao, Sabrina Mantaci, Antonio Restivo:
A new distance based on minimal absent words and applications to biological sequences. CoRR abs/2105.14990 (2021) - [i12]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Recognizability of morphisms. CoRR abs/2110.10267 (2021) - [i11]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Decidable problems in substitution shifts. CoRR abs/2112.14499 (2021) - 2020
- [j96]Giuseppa Castiglione, Sabrina Mantaci, Antonio Restivo:
Some Investigations on Similarity Measures Based on Absent Words. Fundam. Informaticae 171(1-4): 97-112 (2020) - [j95]Raffaele Giancarlo, Giovanni Manzini
The Alternating BWT: An algorithmic perspective. Theor. Comput. Sci. 812: 230-243 (2020) - [j94]Clelia De Felice
Aldo de Luca (1941-2018). Theor. Comput. Sci. 834: 1-2 (2020) - [i10]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
Primitive Sets of Words. CoRR abs/2005.10668 (2020)
2010 – 2019
- 2019
- [j93]Clelia De Felice, Gabriele Fici, Antonio Restivo:
Aldo de Luca (1941 - 2018). Bull. EATCS 127 (2019) - [j92]Francesco Dolce
On generalized Lyndon words. Theor. Comput. Sci. 777: 232-242 (2019) - [j91]Gabriele Fici
Minimal forbidden factors of circular words. Theor. Comput. Sci. 792: 144-153 (2019) - [c55]Francesco Dolce
Some Variations on Lyndon Words (Invited Talk). CPM 2019: 2:1-2:14 - [c54]Giuseppa Castiglione, Gabriele Fici
On Sets of Words of Rank Two. WORDS 2019: 46-59 - [c53]Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
String Attractors and Combinatorics on Words. ICTCS 2019: 57-71 - [i9]Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
Some variations on Lyndon words. CoRR abs/1904.00954 (2019) - [i8]Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
The Alternating BWT: an algorithmic perspective. CoRR abs/1907.02308 (2019) - [i7]Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
String Attractors and Combinatorics on Words. CoRR abs/1907.04660 (2019) - 2018
- [j90]Francesco Dolce
Birecurrent sets. Int. J. Algebra Comput. 28(4): 613-652 (2018) - [j89]Gabriele Fici
Anti-powers in infinite words. J. Comb. Theory A 157: 109-119 (2018) - [c52]Raffaele Giancarlo, Giovanni Manzini
Block Sorting-Based Transformations on Words: Beyond the Magic BWT. DLT 2018: 1-17 - [i6]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
On k-Maximal Submonoids, with Applications in Combinatorics on Words. CoRR abs/1810.02182 (2018) - [i5]Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
On generalized Lyndon words. CoRR abs/1812.04515 (2018) - 2017
- [j88]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Floriana Russo, Marinella Sciortino:
On Fixed Points of the Burrows-Wheeler Transform. Fundam. Informaticae 154(1-4): 277-288 (2017) - [j87]Clelia De Felice
On the decomposition of prefix codes. Theor. Comput. Sci. 664: 117-130 (2017) - [j86]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino, Luca Versari:
Measuring the clustering effect of BWT via RLE. Theor. Comput. Sci. 698: 79-87 (2017) - [c51]Gabriele Fici
Minimal Forbidden Factors of Circular Words. WORDS 2017: 36-48 - [c50]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Burrows-Wheeler Transform and Run-Length Enconding. WORDS 2017: 228-239 - [i4]Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone:
Recurrent and birecurrent sets. CoRR abs/1703.10081 (2017) - [i3]Gabriele Fici, Antonio Restivo, Laura Rizzo:
Minimal Forbidden Factors of Circular Words. CoRR abs/1707.04450 (2017) - 2016
- [c49]Gabriele Fici
Anti-Powers in Infinite Words. ICALP 2016: 124:1-124:9 - [i2]Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni:
Anti-Powers in Infinite Words. CoRR abs/1606.02868 (2016) - 2015
- [c48]Antonio Restivo:
The Shuffle Product: New Research Directions. LATA 2015: 70-81 - 2014
- [j85]Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Sorting conjugates and Suffixes of Words in a Multiset. Int. J. Found. Comput. Sci. 25(8): 1161- (2014) - [j84]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Suffix array and Lyndon factorization of a text. J. Discrete Algorithms 28: 2-8 (2014) - 2013
- [j83]Filippo Mignosi
A New Complexity Function for Words Based on Periodicity. Int. J. Algebra Comput. 23(4): 963-988 (2013) - [c47]Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Suffixes, Conjugates and Lyndon Words. Developments in Language Theory 2013: 131-142 - [c46]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Sorting Suffixes of a Text via its Lyndon Factorization. Stringology 2013: 119-127 - [i1]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Sorting suffixes of a text via its Lyndon Factorization. CoRR abs/1306.1366 (2013) - 2012
- [j82]Ira M. Gessel
A bijection between words and multisets of necklaces. Eur. J. Comb. 33(7): 1537-1546 (2012) - [j81]Giusi Castiglione
On the Shuffle of Star-Free Languages. Fundam. Informaticae 116(1-4): 35-44 (2012) - [j80]Antonio Restivo, Giovanna Rosone
On the product of balanced sequences. RAIRO Theor. Informatics Appl. 46(1): 131-145 (2012) - [j79]Maxime Crochemore, Laura Giambruno, Alessio Langiu
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14: 74-90 (2012) - [j78]Dominique Perrin, Antonio Restivo:
A note on Sturmian words. Theor. Comput. Sci. 429: 265-272 (2012) - [j77]Antonio Restivo, Roberto Vaglica:
A graph theoretic approach to automata minimality. Theor. Comput. Sci. 429: 282-291 (2012) - [j76]Antonio Restivo, Roberto Vaglica:
Extremal minimality conditions on automata. Theor. Comput. Sci. 440-441: 73-84 (2012) - [j75]Giuseppa Castiglione
Nondeterministic Moore automata and Brzozowski's minimization algorithm. Theor. Comput. Sci. 450: 81-91 (2012) - [j74]Filippo Mignosi
Characteristic Sturmian words are extremal for the Critical Factorization Theorem. Theor. Comput. Sci. 454: 199-205 (2012) - 2011
- [j73]Giusi Castiglione
Hopcroft's algorithm and tree-like automata. RAIRO Theor. Informatics Appl. 45(1): 59-75 (2011) - [j72]Antonio Restivo, Giovanna Rosone
Balancing and clustering of words in the Burrows-Wheeler transform. Theor. Comput. Sci. 412(27): 3019-3032 (2011) - [c45]Antonio Restivo, Roberto Vaglica:
Some Remarks on Automata Minimality. Developments in Language Theory 2011: 15-27 - [c44]Giusi Castiglione
Nondeterministic Moore Automata and Brzozowski's Algorithm. CIAA 2011: 88-99 - 2010
- [j71]Jean Berstel, Luc Boasson, Olivier Carton
The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010) - [j70]Roberto Mantaci, Sabrina Mantaci, Antonio Restivo:
Balance Properties and Distribution of Squares in Circular Words. Int. J. Found. Comput. Sci. 21(4): 647-664 (2010) - [j69]Giusi Castiglione
On extremal cases of Hopcroft's algorithm. Theor. Comput. Sci. 411(38-39): 3414-3422 (2010) - [c43]Antonio Restivo, Roberto Vaglica:
Automata with Extremal Minimality Conditions. Developments in Language Theory 2010: 399-410 - [c42]Maxime Crochemore, Laura Giambruno, Alessio Langiu
Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403
2000 – 2009
- 2009
- [j68]Marie-Pierre Béal, Fabio Burderi, Antonio Restivo:
Coding Partitions of Regular Sets. Int. J. Algebra Comput. 19(8): 1011-1023 (2009) - [j67]Antonio Restivo, Giovanna Rosone
Burrows-Wheeler transform and palindromic richness. Theor. Comput. Sci. 410(30-32): 3018-3026 (2009) - [j66]Giusi Castiglione
Circular sturmian words and Hopcroft's algorithm. Theor. Comput. Sci. 410(43): 4372-4381 (2009) - [c41]Antonio Restivo, Giovanna Rosone
Balanced Words Having Simple Burrows-Wheeler Transform. Developments in Language Theory 2009: 431-442 - [c40]Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's Algorithm and Tree-like Automata. ICTCS 2009: 75-81 - [c39]Antonio Restivo, Giovanna Rosone:
On Balancing of a Direct Product. ICTCS 2009: 190-195 - [c38]Giusi Castiglione
On Extremal Cases of Hopcroft's Algorithm. CIAA 2009: 14-23 - 2008
- [j65]Sabrina Mantaci, Antonio Restivo, Marinella Sciortino:
Distance measures for biological sequences: Some recent approaches. Int. J. Approx. Reason. 47(1): 109-124 (2008) - [j64]Laura Giambruno, Antonio Restivo:
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. RAIRO Theor. Informatics Appl. 42(3): 503-524 (2008) - [j63]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
A New Combinatorial Approach to Sequence Comparison. Theory Comput. Syst. 42(3): 411-429 (2008) - [c37]Dora Giammarresi, Antonio Restivo:
Matrix-based complexity functions and recognizable picture languages. Logic and Automata 2008: 307-330 - [c36]Roberto Mantaci, Sabrina Mantaci, Antonio Restivo:
Balance Properties and Distribution of Squares in Circular Words. Developments in Language Theory 2008: 504-515 - [c35]Dora Giammarresi, Antonio Restivo:
Ambiguity and Complementation in Recognizable Two-dimensional Languages. IFIP TCS 2008: 5-20 - [c34]Giusi Castiglione
Hopcroft's Algorithm and Cyclic Automata. LATA 2008: 172-183 - 2007
- [j62]Fabio Burderi, Antonio Restivo:
Coding Partitions. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j61]Giusi Castiglione
Combinatorial aspects of L-convex polyominoes. Eur. J. Comb. 28(6): 1724-1741 (2007) - [j60]Fabio Burderi, Antonio Restivo:
Varieties of Codes and Kraft Inequality. Theory Comput. Syst. 40(4): 507-520 (2007) - [j59]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Languages with mismatches. Theor. Comput. Sci. 385(1-3): 152-166 (2007) - [j58]Raffaele Giancarlo, Antonio Restivo, Marinella Sciortino:
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization. Theor. Comput. Sci. 387(3): 236-248 (2007) - [j57]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
An extension of the Burrows-Wheeler Transform. Theor. Comput. Sci. 387(3): 298-312 (2007) - [c33]Giusi Castiglione, Antonio Restivo:
L-Convex Polyominoes: A Survey. Formal Models, Languages and Applications 2007: 17-33 - [c32]Marie-Pierre Béal, Fabio Burderi, Antonio Restivo:
Coding Partitions: Regularity, Maximality and Global Ambiguity. Developments in Language Theory 2007: 48-59 - 2006
- [j56]Fabio Burderi, Giuseppa Castiglione, Antonio Restivo:
Higman's Theorem on Discrete Sets. Fundam. Informaticae 74(4): 435-446 (2006) - [j55]Clelia de Felice
Preface. Int. J. Found. Comput. Sci. 17(3): 489-492 (2006) - [j54]Marcella Anselmo, Dora Giammarresi, Maria Madonia, Antonio Restivo:
Unambiguous recognizable two-dimensional languages. RAIRO Theor. Informatics Appl. 40(2): 277-293 (2006) - [j53]Giusi Castiglione
A reconstruction algorithm for L-convex polyominoes. Theor. Comput. Sci. 356(1-2): 58-72 (2006) - [j52]Gabriele Fici
Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1-3): 214-230 (2006) - 2005
- [j51]Tero Harju
Preface. Theor. Comput. Sci. 339(1): 1-2 (2005) - [j50]Giusi Castiglione
Enumeration of L-convex polyominoes by rows and columns. Theor. Comput. Sci. 347(1-2): 336-352 (2005) - [c31]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. CPM 2005: 178-189 - [c30]Sabrina Mantaci, Antonio Restivo, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform to k Words. DCC 2005: 469 - [c29]Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi:
A Tomographical Characterization of L-Convex Polyominoes. DGCI 2005: 115-125 - [c28]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
A New Combinatorial Approach to Sequence Comparison. ICTCS 2005: 348-359 - [c27]Fabio Burderi, Antonio Restivo:
Varieties of Codes and Kraft Inequality. STACS 2005: 545-556 - [e2]Clelia de Felice, Antonio Restivo:
Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings. Lecture Notes in Computer Science 3572, Springer 2005, ISBN 3-540-26546-5 [contents] - 2004
- [j49]Giusi Castiglione
Patterns in words and languages. Discret. Appl. Math. 144(3): 237-246 (2004) - [j48]Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
On the Trace Product and some Families of Languages Closed under Partial Commutations. J. Autom. Lang. Comb. 9(1): 61-79 (2004) - [c26]Giusi Castiglione, Antonio Restivo:
Ordering and Convex Polyominoes. MCU 2004: 128-139 - 2003
- [j47]Antonio Restivo, Pedro V. Silva
Periodicity vectors for labelled trees. Discret. Appl. Math. 126(2-3): 241-260 (2003) - [j46]Giusi Castiglione
Reconstruction of L-convex Polyominoes. Electron. Notes Discret. Math. 12: 290-301 (2003) - [j45]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Computing forbidden words of regular languages. Fundam. Informaticae 56(1-2): 121-135 (2003) - [j44]Sabrina Mantaci, Antonio Restivo, Marinella Sciortino:
Burrows-Wheeler transform and Sturmian words. Inf. Process. Lett. 86(5): 241-246 (2003) - [j43]Filippo Mignosi, Antonio Restivo, Pedro V. Silva
On Fine and Wilf's theorem for bidimensional words. Theor. Comput. Sci. 292(1): 245-262 (2003) - [c25]Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Indexing Structures for Approximate String Matching. CIAC 2003: 140-151 - 2002
- [j42]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Words and forbidden factors. Theor. Comput. Sci. 273(1-2): 99-117 (2002) - [j41]Antonio Restivo, Pedro V. Silva
On the lattice of prefix codes. Theor. Comput. Sci. 289(1): 755-782 (2002) - [c24]Antonio Restivo, Sergio Salemi:
Binary Patterns in Infinite Binary Words. Formal and Natural Computing 2002: 107-118 - 2001
- [j40]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. RAIRO Theor. Informatics Appl. 35(6): 565-577 (2001) - [j39]Sabrina Mantaci, Antonio Restivo:
Codes and equations on trees. Theor. Comput. Sci. 255(1-2): 483-509 (2001) - [j38]Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo:
Recurrence and periodicity in infinite words from local periods. Theor. Comput. Sci. 262(1): 269-284 (2001) - [c23]Antonio Restivo, Sergio Salemi:
Words and Patterns. Developments in Language Theory 2001: 117-129 - [c22]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. Developments in Language Theory 2001: 349-358 - [e1]Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi:
Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings. Lecture Notes in Computer Science 2202, Springer 2001, ISBN 3-540-42672-8 [contents] - 2000
- [j37]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Words in Symbolic Dynamics. Adv. Appl. Math. 25(2): 163-193 (2000) - [j36]Maxime Crochemore
Data compression using antidictionaries. Proc. IEEE 88(11): 1756-1768 (2000)
1990 – 1999
- 1999
- [j35]Dora Giammarresi, Antonio Restivo:
Extending Formal Language Hierarchies to Higher Dimensions. ACM Comput. Surv. 31(3es): 12 (1999) - [j34]Maria Gabriella Castelli, Filippo Mignosi, Antonio Restivo:
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words. Theor. Comput. Sci. 218(1): 83-94 (1999) - [c21]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors in Finite and Infinite Words. Jewels are Forever 1999: 339-350 - [c20]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Text Compression Using Antidictionaries. ICALP 1999: 261-270 - 1998
- [j33]Maxime Crochemore
Automata and Forbidden Words. Inf. Process. Lett. 67(3): 111-117 (1998) - [j32]Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Periodicity and the Golden Ratio. Theor. Comput. Sci. 204(1-2): 153-167 (1998) - [j31]Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo:
Periodicities on Trees. Theor. Comput. Sci. 205(1-2): 145-181 (1998) - [c19]Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673 - 1997
- [c18]Sabrina Mantaci, Antonio Restivo:
Tree Codes and Equations. Developments in Language Theory 1997: 119-133 - [p1]Dora Giammarresi, Antonio Restivo:
Two-Dimensional Languages. Handbook of Formal Languages (3) 1997: 215-267 - 1996
- [j30]Dora Giammarresi, Antonio Restivo:
Two-Dimensional Finite State Recognizability. Fundam. Informaticae 25(3): 399-422 (1996) - [j29]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. Inf. Comput. 125(1): 32-45 (1996) - [j28]Marcella Anselmo, Antonio Restivo:
On Languages Factorizing the Free Monoid. Int. J. Algebra Comput. 6(4): 413-428 (1996) - [c17]Sabrina Mantaci, Antonio Restivo:
Equations on Trees. MFCS 1996: 443-456 - [c16]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Symbolic Dynamics. STACS 1996: 555-566 - 1995
- [c15]Filippo Mignosi, Antonio Restivo, Sergio Salemi:
A Periodicity Theorem on Words and Applications. MFCS 1995: 337-348 - 1994
- [j27]Rosa Montalbano, Antonio Restivo:
On the Star Height of Rational Languages. Int. J. Algebra Comput. 4(3): 427-442 (1994) - [c14]Marcella Anselmo, Antonio Restivo:
Factorizing Languages. IFIP Congress (1) 1994: 445-450 - [c13]Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo:
A Periodicity Theorem for Trees. IFIP Congress (1) 1994: 473-478 - [c12]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS 1994: 365-375 - 1992
- [j26]Dora Giammarresi, Antonio Restivo:
Recognizable Picture Languages. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 241-256 (1992) - [j25]Antonio Restivo:
A Note on Renewal Systems. Theor. Comput. Sci. 94(2): 367-371 (1992) - [j24]Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
Star-Free Trace Languages. Theor. Comput. Sci. 97(2): 301-311 (1992) - 1991
- [c11]Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
On Aperiodic Trace Languages. STACS 1991: 76-88 - 1990
- [j23]Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
Complete subgraphs of bipartite graphs and applications to trace languages. RAIRO Theor. Informatics Appl. 24: 409-417 (1990) - [j22]Antonio Restivo:
Codes and Local Constraints. Theor. Comput. Sci. 72(1): 55-64 (1990)
1980 – 1989
- 1989
- [j21]Antonio Restivo, Sergio Salemi, Tecla Sportelli:
Completing Codes. RAIRO Theor. Informatics Appl. 23(2): 135-147 (1989) - [j20]Antonio Restivo:
Finitely Generated Sofic Systems. Theor. Comput. Sci. 65(2): 265-270 (1989) - [j19]Antonio Restivo:
A note on multiset decipherable codes. IEEE Trans. Inf. Theory 35(3): 662-663 (1989) - 1988
- [c10]Antonio Restivo:
Codes and Automata. Formal Properties of Finite Automata and Applications 1988: 186-198 - 1986
- [j18]Aldo de Luca, Antonio Restivo:
On a generalization of a conjecture of Ehrenfeucht. Bull. EATCS 30: 84-90 (1986) - [j17]Aldo de Luca, Antonio Restivo:
Star-Free Sets of Integers. Theor. Comput. Sci. 43: 265-275 (1986) - 1985
- [j16]Clelia de Felice, Antonio Restivo:
Some Results On Finite Maximal Codes. RAIRO Theor. Informatics Appl. 19(4): 383-403 (1985) - [j15]Antonio Restivo, Christophe Reutenauer:
Rational Languages and the Burnside Problem. Theor. Comput. Sci. 40: 13-30 (1985) - 1984
- [j14]Antonio Restivo, Christophe Reutenauer:
On Cancellation Properties of Languages which are Supports of Ration Power Series. J. Comput. Syst. Sci. 29(2): 153-159 (1984) - [c9]Antonio Restivo, Christophe Reutenauer:
Cancellation, Pumping and Permutation in Formal Languages. ICALP 1984: 414-422 - [c8]Antonio Restivo, Sergio Salemi:
Overlap-free words on two symbols. Automata on Infinite Words 1984: 198-206 - [c7]Aldo de Luca, Antonio Restivo:
Representations lf Integers and Language Theory. MFCS 1984: 407-415 - 1983
- [j13]Antonio Restivo, Sergio Salemi:
On weakly square free words. Bull. EATCS 21: 49-57 (1983) - [j12]Antonio Restivo, Christophe Reutenauer:
Some Applications of a Theorem of Shirshov to Language Theory. Inf. Control. 57(2/3): 205-213 (1983) - [j11]Aldo de Luca, Antonio Restivo, Sergio Salemi:
On the Centers of a Language. Theor. Comput. Sci. 24: 21-34 (1983) - 1981
- [j10]S. Mauceri, Antonio Restivo:
A Family of Codes Commutatively Equivalent to Prefix Codes. Inf. Process. Lett. 12(1): 1-4 (1981) - 1980
- [j9]Aldo de Luca, Antonio Restivo:
A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup. Inf. Control. 44(3): 300-319 (1980) - [j8]Aldo de Luca, Antonio Restivo:
On Some Properties of Very Pure Codes. Theor. Comput. Sci. 10: 157-170 (1980) - [j7]Jean-Marie Boë, Aldo de Luca, Antonio Restivo:
Minimal Complete Sets of Words. Theor. Comput. Sci. 12: 325-332 (1980) - [c6]Aldo de Luca, Antonio Restivo:
On Some Properties of Local Testability. ICALP 1980: 385-393
1970 – 1979
- 1979
- [j6]Aldo de Luca, Dominique Perrin, Antonio Restivo, Settimo Termini:
Synchronization and simplification. Discret. Math. 27(3): 297-308 (1979) - [c5]Aldo de Luca, Antonio Restivo:
Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup. MFCS 1979: 363-371 - 1978
- [c4]Antonio Restivo:
Some Decision Results for Recognizable Sets in Arbitrary Monoids. ICALP 1978: 363-371 - 1977
- [j5]Antonio Restivo:
On codes having no finite completions. Discret. Math. 17(3): 309-316 (1977) - [j4]Antonio Restivo:
Mots Sans Répétitions et Langages Rationnels Bornés. RAIRO Theor. Informatics Appl. 11(3): 197-202 (1977) - [j3]Luc Boasson, Antonio Restivo:
Une Caractérisation des Langages Algébriques Bornés. RAIRO Theor. Informatics Appl. 11(3): 203-205 (1977) - 1976
- [c3]Antonio Restivo:
On a Family of Codes Related to Factorization of Cyclotomic Polynomials. ICALP 1976: 38-44 - 1975
- [j2]Antonio Restivo:
A Combinatorial Property of Codes Having Finite Synchronization Delay. Theor. Comput. Sci. 1(2): 95-101 (1975) - [c2]Antonio Restivo:
A characterization of bounded regular sets. Automata Theory and Formal Languages 1975: 239-244 - 1974
- [j1]Antonio Restivo:
On a Question of McNaughton and Papert. Inf. Control. 25(1): 93-101 (1974) - 1973
- [c1]Antonio Restivo:
Codes and aperiodic languages. Automatentheorie und Formale Sprachen 1973: 175-181
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: