On a complexity hierarchy between L and NL

Authors:
S. Cho;D. T. Huynh
Affiliations:
Univ. of Texas at Dallas, Richardson;Univ. of Texas at Dallas, Richardson
Venue:
Information Processing Letters
Year:
1988

Citing 0
Cited 3

On partially blind multihead finite automata

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
A note on the space complexity of some decision problems for finite automata

Information Processing Letters
On the universe, disjointness, and containment problems for simple machines

Information and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract