About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines
Authors:
Burkhard Monien
Affiliations:
-
Venue:
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Year:
1975
Citing
0
Cited
1
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Quantified Score
Hi-index
0.00
Visualization
Abstract