| |
| 2004 | ||
|---|---|---|
| 6 | Jean Neraud, Carla Selmi: A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. Journal of Automata, Languages and Combinatorics 9(1): 103-110 (2004) | |
| 2003 | ||
| 5 | EE | Jean Neraud, Carla Selmi: Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. IJAC 13(5): 507-516 (2003) |
| 2002 | ||
| 4 | EE | Jean Neraud, Carla Selmi: Locally complete sets and finite decomposable codes. Theor. Comput. Sci. 273(1-2): 185-196 (2002) |
| 2001 | ||
| 3 | EE | Jean Neraud, Carla Selmi: On codes with a finite deciphering delay: constructing uncompletable words. Theor. Comput. Sci. 255(1-2): 151-162 (2001) |
| 1999 | ||
| 2 | Carla Selmi: Strongly locally testable semigroups with commuting idempotents and related languages. ITA 33(1): 47-58 (1999) | |
| 1996 | ||
| 1 | EE | Carla Selmi: Over Testable Languages. Theor. Comput. Sci. 161(1&2): 157-190 (1996) |
| 1 | Jean Neraud | [3] [4] [5] [6] |