论文信息 - One-Way Multihead Writing Finite Automata

One-Way Multihead Writing Finite Automata

The family of languages recognized by one-way multihead writing finite automata is investigated. It is shown that there are languages recognized by deterministic three-head one-way nonwriting finite automata that cannot be recognized by any nondeterministic two-head one-way writing finite automaton.

I. HAL SUDBOROUGH

[1] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[3] Ivan Hal Sudborough,et al. Bounded-Reversal Multihead Finite Automata Languages , 1974, Inf. Control..

[4] 有沢誠. Computational Complexity of One-Tape Turing Machine Computations , 1969 .

[5] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

[6] Oscar H. Ibarra,et al. Simple Matrix Languages , 1970, Inf. Control..

[7] Rani Siromoney,et al. On Equal Matrix Languages , 1969, Inf. Control..

[8] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[9] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[10] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[11] Oscar H. Ibarra,et al. Multi-Tape and Multi-Head Pushdown Automata , 1968, Inf. Control..

[12] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..