Clelia de Felice

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone: Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012)

Clelia de Felice: A note on the factorization conjecture. CoRR abs/1205.2310 (2012)

Arturo Carpi, Clelia de Felice: Combinatorics on words. Theor. Comput. Sci. 412(27): 2909-2910 (2011)

Paola Bonizzoni, Clelia de Felice, Gabriele Fici, Rosalba Zizza: On the regularity of circular splicing languages: a survey and new developments. Natural Computing 9(2): 397-420 (2010)

Paola Bonizzoni, Clelia de Felice, Rosalba Zizza: A characterization of (regular) circular languages generated by monotone complete splicing systems. Theor. Comput. Sci. 411(48): 4149-4161 (2010)

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone: Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010)

Clelia de Felice, Gabriele Fici, Rosalba Zizza: A characterization of regular circular languages generated by marked splicing systems. Theor. Comput. Sci. 410(47-49): 4937-4960 (2009)

Paola Bonizzoni, Clelia de Felice, Rosalba Zizza: Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages. DCM 2009: 22-31

Clelia de Felice: Finite Completions via Factorizing Codes. IJAC 17(4): 715-760 (2007)

Clelia de Felice, Gabriele Fici, Rosalba Zizza: Marked Systems and Circular Splicing. FCT 2007: 238-249

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza: Linear splicing and syntactic monoid. Discrete Applied Mathematics 154(3): 452-470 (2006)

Clelia de Felice, Antonio Restivo: Preface. Int. J. Found. Comput. Sci. 17(3): 489-492 (2006)

Clelia de Felice: On a complete set of operations for factorizing codes. ITA 40(1): 29-52 (2006)

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza: On the power of circular splicing. Discrete Applied Mathematics 150(1-3): 51-66 (2005)

Paola Bonizzoni, Clelia de Felice, Rosalba Zizza: The structure of reflexive regular splicing languages via Schützenberger constants. Theor. Comput. Sci. 334(1-3): 71-98 (2005)

Clelia de Felice: An enhanced property of factorizing codes. Theor. Comput. Sci. 340(1): 240-256 (2005)

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri: Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages. CiE 2005: 65-67

Clelia de Felice, Antonio Restivo (Eds.): 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

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza: Circular splicing and regularity. ITA 38(3): 189-228 (2004)

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza: Regular Languages Generated by Reflexive Finite Splicing Systems. Developments in Language Theory 2003: 134-145

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza: Decision Problems for Linear and Circular Splicing Systems. Developments in Language Theory 2002: 78-92

Clelia de Felice: On Some Schützenberger Conjectures. Inf. Comput. 168(2): 144-155 (2001)

Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza: DNA and Circular Splicing. DNA Computing 2000: 117-129

Clelia de Felice: Factorizing Codes and Schützenberger Conjectures. MFCS 2000: 295-303

Clelia de Felice: On a Property of the Factorizing Codes. IJAC 9(3-4): 325-346 (1999)

Véronique Bruyère, Clelia de Felice: On the Existence of Codings Between Trace Monoids. Journal of Automata, Languages and Combinatorics 4(2): 87-100 (1999)

Clelia de Felice: Hajós Factorizations of Cyclic Groups - A Simpler Proof of a Characterization. Journal of Automata, Languages and Combinatorics 4(2): 111-116 (1999)

Véronique Bruyère, Clelia de Felice: Any Lifting of a Trace Coding is a Word Coding. Inf. Comput. 130(2): 183-193 (1996)

Clelia de Felice: An Application of Hajós Factorizations to Variable-Length Codes. Theor. Comput. Sci. 164(1&2): 223-252 (1996)

Véronique Bruyère, Clelia de Felice: Synchronization and decomposability for a family of codes: Part 2. Discrete Mathematics 140(1-3): 47-77 (1995)

Véronique Bruyère, Clelia de Felice, Giovanna Guaiana: On Some Decision Problems for Trace Codings. Theor. Comput. Sci. 148(2): 227-260 (1995)

Véronique Bruyère, Clelia de Felice: Coding and Strong Coding in Trace Monoids. STACS 1995: 373-384

Véronique Bruyère, Clelia de Felice, Giovanna Guaiana: Coding with Traces. STACS 1994: 353-364

Clelia de Felice: A partial result about the factorization conjecture for finite variable-length codes. Discrete Mathematics 122(1-3): 137-152 (1993)

Clelia de Felice: On the Factorization Conjecture. STACS 1992: 545-556

Véronique Bruyère, Clelia de Felice: Degree and Decomposability of Variable-Length Codes. ICALP 1991: 575-587

Clelia de Felice: Construction of a Family of Finite Maximal Codes. Theor. Comput. Sci. 63(2): 157-184 (1989)

Clelia de Felice: On the finite completion of codes. Bulletin of the EATCS 34: 52-54 (1988)

Clelia de Felice: Finite Biprefix Sets of Paths in a Graph. Theor. Comput. Sci. 58: 103-128 (1988)

Clelia de Felice: Construction of a Family of Finite Maximal Codes. STACS 1988: 159-169

Clelia de Felice: Finite Biprefix Sets of Path in a Graph. ICALP 1986: 89-94

Clelia de Felice, Antonio Restivo: Some Results On Finite Maximal Codes. ITA 19(4): 383-403 (1985)

Clelia de Felice: Construction de Codes Factorisants. Theor. Comput. Sci. 36: 99-108 (1985)

Clelia de Felice: Construction of a Family of Factorizing Codes. STACS 1985: 80-86

Clelia de Felice: On the Triangle Conjecture. Inf. Process. Lett. 14(5): 197-200 (1982)