Measures of parallelism in alternating computation trees (Extended Abstract)

Authors:
K. N. King
Affiliations:
-
Venue:
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Year:
1981

Citing 3
Cited 7

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Tree-size bounded alternation(Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
General context-free language recognition.

General context-free language recognition.

P-uniform circuit complexity

Journal of the ACM (JACM)
A leaf-size hierarchy of alternating rebound Turing machines

Journal of Automata, Languages and Combinatorics
Two-dimensional alternating Turing machines

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Four-dimensional multi-inkdot finite automata

WSEAS Transactions on Computers
A survey of three-dimensional automata

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Synchronized alternating turing machines on four-dimensional input tapes

WSEAS Transactions on Computers
Hardware hierarchies and recognizabilities of four-dimensional synchronized alternating turing machines

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine three ways of restricting the size (and shape) of the accepting computation trees of alternating Turing machines. We continue study by examining bounds on the number of leaves in the tree (Section 3), the 'width' of the tree (Section 4), and the number of nodes at any level of the tree (Section 5). Each of these measures can be interpreted as a limit on the amount of parallelism permitted the computation.