| 1978 |
|---|
| 8 | | Alan Cobham:
Representation of a Word Function as the Sum of Two Functions.
Mathematical Systems Theory 11: 373-377 (1978) |
| 1972 |
|---|
| 7 | | Alan Cobham:
Uniform Tag Seqences.
Mathematical Systems Theory 6(3): 164-192 (1972) |
| 1969 |
|---|
| 6 | | Alan Cobham:
On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata.
Mathematical Systems Theory 3(2): 186-192 (1969) |
| 1968 |
|---|
| 5 | | Alan Cobham:
On the Hartmanis-Stearns Problem for a Class of TAG Machines
FOCS 1968: 51-60 |
| 1966 |
|---|
| 4 | | Alan Cobham:
The Recognition Problem for the Set of Perfect Squares
FOCS 1966: 78-87 |
| 1963 |
|---|
| 3 | | Alan Cobham:
Some Remarks Concerning Theories with Recursively Enumerable Complements.
J. Symb. Log. 28(1): 72-74 (1963) |
| 1961 |
|---|
| 2 | | Alan Cobham,
R. Fridshal,
J. H. North:
An application of linear programming to the minimization of Boolean functions
FOCS 1961: 3-9 |
| 1956 |
|---|
| 1 | | Alan Cobham:
Reduction to a Symmetric Predicate.
J. Symb. Log. 21(1): 56-59 (1956) |
