Carla Selmi

According to our database, Carla Selmi authored at least 15 papers between 1996 and 2025.

Collaborative distances:

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

2025

Tiling of toroidal arrays with pictures: Uniqueness, shift-equivalence and undecidability.

Marcella Anselmo, Matteo Cavallaro, Maria Madonia, Carla Selmi

Theor. Comput. Sci., 2025

Fibonacci Pictures on a Binary Alphabet.

Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi

Proceedings of the Descriptional Complexity of Formal Systems, 2025

2020

Embedding a <i>θ</i>-invariant code into a complete one.

Jean Néraud, Carla Selmi

Theor. Comput. Sci., 2020

Bad Pictures: Some Structural Properties Related to Overlaps.

Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

Toroidal Codes and Conjugate Pictures.

Marcella Anselmo, Maria Madonia, Carla Selmi

Proceedings of the Language and Automata Theory and Applications, 2019

2018

Embedding a θ-invariant code into a complete one.

Jean Néraud, Carla Selmi

CoRR, 2018

2017

Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms.

Jean Néraud, Carla Selmi

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

2012

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.

Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2009

Strategical languages of infinite words.

Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi

Inf. Process. Lett., 2009

2004

A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A^*.

Jean Néraud, Carla Selmi

J. Autom. Lang. Comb., 2004

2003

Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids.

Jean Néraud, Carla Selmi

Int. J. Algebra Comput., 2003

2002

Locally complete sets and finite decomposable codes.

Jean Néraud, Carla Selmi

Theor. Comput. Sci., 2002

2001

On codes with a finite deciphering delay: constructing uncompletable words.

Jean Néraud, Carla Selmi

Theor. Comput. Sci., 2001

1999

Strongly locally testable semigroups with commuting idempotents and related languages.

Carla Selmi

RAIRO Theor. Informatics Appl., 1999

1996

Over Testable Languages.

Carla Selmi

Theor. Comput. Sci., 1996