论文信息 - Bounded-Reversal Multihead Finite Automata Languages

Bounded-Reversal Multihead Finite Automata Languages

A well-known open problem in computational complexity is to find an easily specified language not recognized by any log2 n tape-bounded Turing machine. It is known that the log2 n family is identical to the family of languages recognized by two-way multihead finite automata. Attention here is restricted to those multihead automata which may only reverse each head a fixed constant number of times. It is shown that every bounded language recognized by an automaton from this family satisfies the semilinear property. Thus, easily specified languages which are too complex to be recognized by these restricted multihead automata are obtained.

Ivan Hal Sudborough | I. H. Sudborough

[1] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[2] Arnold L. Rosenberg. On multi-head finite automata , 1965, SWCT.

[3] I. H. Sudborough. Computation by Multi-Head Finite Automata , 1971, SWAT.

[4] Oscar H. Ibarra,et al. On Two-way Multihead Automata , 1973, J. Comput. Syst. Sci..

[5] Ivan Hal Sudborough,et al. Computation by multi-head writing finite automata , 1971 .

[6] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[7] Frederick N. Springsteel,et al. Language Recognition by Marking Automata , 1972, Inf. Control..

[8] Seymour Ginsburg,et al. AFL with the Semilinear Property , 1971, J. Comput. Syst. Sci..

[9] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[10] S. Ginsburg,et al. Bounded -like languages , 1964 .

[11] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

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