A language over a one symbol alphabet requiring only O (log log n) space

Authors:
Helmut Alt;Kurt Mehlhorn
Affiliations:
Fachbereich 10, Universität des Saarlandes, 66 Saarbrucken, West Germany;Fachbereich 10, Universität des Saarlandes, 66 Saarbrucken, West Germany
Venue:
ACM SIGACT News
Year:
1975

Citing 1
Cited 2

Formal languages and their relation to automata

Formal languages and their relation to automata

Nondeterministic one-tape off-line turing machines and their time complexity

Journal of Automata, Languages and Combinatorics
One Pebble Versus ε · log n Bits

Fundamenta Informaticae - Non-Classical Models of Automata and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract