The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gerard Lallement: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gerard Lallement
    The Word Problem for Thue Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:27-38 [Conf]
  2. Gerard Lallement, C. Reis
    Team Tournaments and Finite Elementary Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:48, n:1, pp:11-29 [Journal]
  3. Gerard Lallement, R. McFadden
    On the Determination of Green's Relations in Finite Tranformation Semigroups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:5, pp:481-498 [Journal]
  4. Gerard Lallement
    On the Prime Decomposition Theorem for Finite Monoids. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1971, v:5, n:1, pp:8-12 [Journal]
  5. Gerard Lallement
    Regular Semigroups with D = R as Syntactic Monoids of Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:1, pp:35-49 [Journal]
  6. Gerard Lallement, Dominique Perrin
    A graph covering construction of all the finite complete biprefix codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:36, n:3, pp:261-271 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002