About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Computer and System Sciences
Paper
Multitape one-way nonwriting automata
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.