Multitape one-way nonwriting automata

Authors:
Patrick C. Fischer;Arnold L. Rosenberg
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1968

Citing 7
Cited 6

Quotients of Context-Free Languages

Journal of the ACM (JACM)
On Formalisms for Turing Machines

Journal of the ACM (JACM)
Finite automata and their decision problems

IBM Journal of Research and Development
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development
On multi-head finite automata

IBM Journal of Research and Development
On relations defined by generalized finite automata

IBM Journal of Research and Development
Multitape finite automata with rewind instructions

Journal of Computer and System Sciences

HMSCs as Partial Specifications ... with PNs as Completions

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
R70-23 Multi-Tape and Multi-Head Pushdown Automata

IEEE Transactions on Computers
On the Decidability of the Equivalence for k-Valued Transducers

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata

Theoretical Computer Science
Finite-turn checking automata

Journal of Computer and System Sciences
Abstract families of relations

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

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.