Path-bounded four-dimensional finite automata

Authors:
Yasuo Uchida;Takao Ito;Makoto Sakamoto;Ryoju Katamune;Kazuyuki Uchida;Hiroshi Furutani;Michio Kono;Satoshi Ikeda;Tsunehito Yoshinaga
Affiliations:
Ube National College of Technology, Department of Business Administration, Ube City, Yamaguchi, Japan;Ube National College of Technology, Department of Business Administration, Ube City, Yamaguchi, Japan;Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki City, Miyazaki, Japan;Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki City, Miyazaki, Japan;Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki City, Miyazaki, Japan;Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki City, Miyazaki, Japan;Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki City, Miyazaki, Japan;Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki City, Miyazaki, Japan;Department of Computer Science and Electronic Engineering, Tokuyama College of Technology, Yamaguchi, Yamaguchi, Japan
Venue:
ICOSSSE'10 Proceedings of the 9th WSEAS international conference on System science and simulation in engineering
Year:
2010

Citing 2
Cited 0

Nondeterministic communication with a limited number of advice bits

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
k + 1 Heads Are Better than k

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The comparative study of the computational powers of deterministic and nondeterministic computations is one of the central tasks of complexity theory. This paper investigates the computational power of nondeterministic computing devices with restricted nondeterminism. There are only few results measuring the computational power of restricted nondeterminism. In general, there are three possibilities to measure the amount of nondeterminism in computation. In this paper, we consider the possibility to count the number of different nondeterministic computation paths on any input. In particular, we deal with seven-way four-dimensional finite automata with multiple input heads operating on four-dimensional input tapes.