论文信息 - Relationships Between Nondeterministic and Deterministic Tape Complexities - 字舞流文

Relationships Between Nondeterministic and Deterministic Tape Complexities

Walter J. Savitch | W. Savitch

[1] James B. Morris. Formal Languages and their Relation to Automata , 1970 .

[2] Walter J. Savitch. Deterministic simulation of non-deterministic turing machines (Detailed Abstract) , 1969, STOC '69.

[3] Albert R. Meyer,et al. Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.

[4] Jeffrey D. Ullman,et al. Relations Between Time and Tape Complexities , 1968, JACM.

[5] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[6] Alan Cobham,et al. The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[7] Donald R. Haring. Sixth Annual Symposium on Switching Circuit Theory and Logical Design , 1966 .

[8] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[9] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[10] Peter S. Landweber,et al. Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..