Multitape one-way nonwriting automata

Patrick C. Fischer; Arnold L. Rosenberg

doi:10.1016/S0022-0000(68)80006-6

Journal of Computer and System Sciences

Paper

01 Jun 1968

Multitape one-way nonwriting automata

View publication

Abstract

The theory given by Rabin and Scott for one-tape finite automata is extended to cover machines with several input tapes which can be advanced independently under finite-state control. © 1996 Academic Press, Inc.

Paper

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Y.Y. Li, K.S. Leung, et al.

J Combin Optim

Paper

Quantum Simulators: Architectures and Opportunities

Ehud Altman, Kenneth R. Brown, et al.

PRX Quantum

Paper

Multiparameter parallel search branch switching

Michael E. Henderson

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

Paper

On storing arbitrarily many extendible arrays of arbitrary dimensions

Arnold L. Rosenberg

International Journal of Computer & Information Sciences

View all publications

Abstract

Related

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Quantum Simulators: Architectures and Opportunities

Multiparameter parallel search branch switching

On storing arbitrarily many extendible arrays of arbitrary dimensions