The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean Neraud: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maxime Crochemore, Jean Neraud
    Unitary Monoid with Two Generators: An Algorithmic Point of View. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:117-131 [Conf]
  2. Jean Neraud
    On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:360-369 [Conf]
  3. Jean Neraud
    On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm. [Citation Graph (0, 0)][DBLP]
    IWWERT, 1991, pp:187-196 [Conf]
  4. Jean Neraud
    Completing a Code in a Regular Submonoid of the Free Monoid. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:281-291 [Conf]
  5. Jean Neraud
    New Algorithms for Detecting Morphic Images of a Word. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:588-597 [Conf]
  6. Jean Neraud
    Detecting Morphic Images of a Word on the Rank of a Pattern [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:5, pp:477-489 [Journal]
  7. Jean Neraud
    On the Completion of Codes in Submonoids with Finite Rank. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:4, pp:549-562 [Journal]
  8. Jean Neraud
    Algorithms for Detecting Morphic Images of a Word [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:126-148 [Journal]
  9. Jean Neraud, Carla Selmi
    Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. [Citation Graph (0, 0)][DBLP]
    IJAC, 2003, v:13, n:5, pp:507-516 [Journal]
  10. Jean Neraud
    Elementariness of a finite set of words is co-NP-complete. [Citation Graph (0, 0)][DBLP]
    ITA, 1990, v:24, n:, pp:459-470 [Journal]
  11. Jean Neraud
    Detecting the Morphic Images of a Word: Improving the General Algorithm. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:1, pp:1-14 [Journal]
  12. Jean Neraud, Carla Selmi
    A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:103-110 [Journal]
  13. Jean Neraud
    WORDS '99 - Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:1-3 [Journal]
  14. Jean Neraud
    Completing prefix codes in submonoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:245-254 [Journal]
  15. Jean Neraud
    On the Rank of the Subsets of a Free Monoid. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:2, pp:231-241 [Journal]
  16. Jean Neraud
    Deciding Whether a Finite Set of Words has Rank at Most Two. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:112, n:2, pp:311-337 [Journal]
  17. Jean Neraud, Maxime Crochemore
    A String-Matching Interpretation of the Equation xmyn = zp. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:145-164 [Journal]
  18. Jean Neraud, Carla Selmi
    On codes with a finite deciphering delay: constructing uncompletable words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:151-162 [Journal]
  19. Jean Neraud, Carla Selmi
    Locally complete sets and finite decomposable codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:185-196 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002