default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarla Selmi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]Jean Néraud
, Carla Selmi:
Embedding a θ-invariant code into a complete one. Theor. Comput. Sci. 806: 28-41 (2020)- [c4]Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi:
Bad Pictures: Some Structural Properties Related to Overlaps. DCFS 2020: 13-25
2010 – 2019
- 2019
- [c3]Marcella Anselmo, Maria Madonia, Carla Selmi:
Toroidal Codes and Conjugate Pictures. LATA 2019: 288-301 - 2018
- [i3]Jean Néraud, Carla Selmi:
Embedding a θ-invariant code into a complete one. CoRR abs/1801.05164 (2018) - 2017
- [c2]Jean Néraud, Carla Selmi:
Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. WORDS 2017: 214-227 - [i2]Jean Néraud, Carla Selmi:
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. CoRR abs/1705.05564 (2017) - 2015
- [j8]Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi:
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Int. J. Found. Comput. Sci. 26(6): 733-750 (2015) - 2012
- [c1]Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi:
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Developments in Language Theory 2012: 471-476 - 2010
- [i1]Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi:
Strategical languages of infinite words. CoRR abs/1003.0662 (2010)
2000 – 2009
- 2009
- [j7]Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi:
Strategical languages of infinite words. Inf. Process. Lett. 109(13): 749-753 (2009) - 2004
- [j6]Jean Néraud, Carla Selmi:
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. J. Autom. Lang. Comb. 9(1): 103-110 (2004) - 2003
- [j5]Jean Néraud, Carla Selmi:
Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. Int. J. Algebra Comput. 13(5): 507-516 (2003) - 2002
- [j4]Jean Néraud, Carla Selmi:
Locally complete sets and finite decomposable codes. Theor. Comput. Sci. 273(1-2): 185-196 (2002) - 2001
- [j3]Jean Néraud, Carla Selmi:
On codes with a finite deciphering delay: constructing uncompletable words. Theor. Comput. Sci. 255(1-2): 151-162 (2001)
1990 – 1999
- 1999
- [j2]Carla Selmi:
Strongly locally testable semigroups with commuting idempotents and related languages. RAIRO Theor. Informatics Appl. 33(1): 47-58 (1999) - 1996
- [j1]Carla Selmi:
Over Testable Languages. Theor. Comput. Sci. 161(1&2): 157-190 (1996)
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-04-24 23:03 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:
