Rusins Freivalds Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1985, v:27, n:, pp:35-39 [Journal]
Arto Salomaa The Ehrenfeucht conjecture: a proof for language theorists. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1985, v:27, n:, pp:71-82 [Journal]
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