Alan Cobham Some Remarks Concerning Theories with Recursively Enumerable Complements. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1963, v:28, n:1, pp:72-74 [Journal]

Alan Cobham On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1969, v:3, n:2, pp:186-192 [Journal]

Alan Cobham Representation of a Word Function as the Sum of Two Functions. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1978, v:11, n:, pp:373-377 [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