Carla Selmi

18 papers C 2Journal 13Unranked 3
YearRankTypeTitle / Venue / Authors
2025 — conf
Fibonacci Pictures on a Binary Alphabet.
DCFS
Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi
2025 J jnl
Tiling of toroidal arrays with pictures: Uniqueness, shift-equivalence and undecidability.
Theor. Comput. Sci.
Marcella Anselmo, Matteo Cavallaro, Maria Madonia, Carla Selmi
2020 — conf
Bad Pictures: Some Structural Properties Related to Overlaps.
DCFS
Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi
2020 J jnl
Embedding a
Theor. Comput. Sci.
Jean Néraud, Carla Selmi
2019 C conf
Toroidal Codes and Conjugate Pictures.
LATA
Marcella Anselmo, Maria Madonia, Carla Selmi
2018 J jnl
Embedding a θ-invariant code into a complete one.
CoRR
Jean Néraud, Carla Selmi
2017 — conf
Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms.
WORDS
Jean Néraud, Carla Selmi
2017 J jnl
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms.
CoRR
Jean Néraud, Carla Selmi
2015 J jnl
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.
Int. J. Found. Comput. Sci.
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
2012 C conf
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.
Developments in Language Theory
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
2010 J jnl
Strategical languages of infinite words
CoRR
Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi
2009 J jnl
Strategical languages of infinite words.
Inf. Process. Lett.
Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi
2004 J jnl
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A
J. Autom. Lang. Comb.
Jean Néraud, Carla Selmi
2003 J jnl
Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids.
Int. J. Algebra Comput.
Jean Néraud, Carla Selmi
2002 J jnl
Locally complete sets and finite decomposable codes.
Theor. Comput. Sci.
Jean Néraud, Carla Selmi
2001 J jnl
On codes with a finite deciphering delay: constructing uncompletable words.
Theor. Comput. Sci.
Jean Néraud, Carla Selmi
1999 J jnl
Strongly locally testable semigroups with commuting idempotents and related languages.
RAIRO Theor. Informatics Appl.
Carla Selmi
1996 J jnl
Over Testable Languages.
Theor. Comput. Sci.
Carla Selmi