Over Testable Languages. - Carla Selmi (Theor. Comput. Sci., 1996)

Strongly locally testable semigroups with commuting idempotents and related languages. - Carla Selmi (RAIRO Theor. Informatics Appl., 1999)

On codes with a finite deciphering delay: constructing uncompletable words. - Jean Néraud; Carla Selmi (Theor. Comput. Sci., 2001)

Locally complete sets and finite decomposable codes. - Jean Néraud; Carla Selmi (Theor. Comput. Sci., 2002)

Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. - Jean Néraud; Carla Selmi (Int. J. Algebra Comput., 2003)

A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. - Jean Néraud; Carla Selmi (J. Autom. Lang. Comb., 2004)

Strategical languages of infinite words. - Mustapha Arfi; Bedine Ould M. Lemine; Carla Selmi (Inf. Process. Lett., 2009)

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. - Laura Giambruno; Sabrina Mantaci; Jean Néraud; Carla Selmi (Int. J. Found. Comput. Sci., 2015)

Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. - Jean Néraud; Carla Selmi (WORDS, 2017)

Embedding a θ-invariant code into a complete one. - Jean Néraud; Carla Selmi (CoRR, 2018)

Toroidal Codes and Conjugate Pictures. - Marcella Anselmo; Maria Madonia; Carla Selmi (LATA, 2019)

Bad Pictures: Some Structural Properties Related to Overlaps. - Marcella Anselmo; Dora Giammarresi; Maria Madonia; Carla Selmi (DCFS, 2020)

Embedding a θ-invariant code into a complete one. - Jean Néraud; Carla Selmi (Theor. Comput. Sci., 2020)

Fibonacci Pictures on a Binary Alphabet. - Marcella Anselmo; Dora Giammarresi; Maria Madonia; Carla Selmi (DCFS, 2025)

Tiling of toroidal arrays with pictures: Uniqueness, shift-equivalence and undecidability. - Marcella Anselmo; Matteo Cavallaro; Maria Madonia; Carla Selmi (Theor. Comput. Sci., 2025)