Affiliation:
1. IBM Watson Research Center, Yorktown Heights, New York
Abstract
The closure properties of the class of languages defined by real-time, online, multi-tape Turing machines are proved. The results obtained are, for the most part, negative and, as one would expect, asymmetric. It is shown that the results remain valid for a broad class of real-time devices. Finally, the position of the class of real-time definable languages in the “classical” linguistic hierarchy is established.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference10 articles.
1. COLE S.N. real-time computation by iterative arrays of finite-state machines. Doctoral thesis Rep. BL-36 by Staff of ttarvard Computation Lab. to Bell Telephone Labs. 1964. COLE S.N. real-time computation by iterative arrays of finite-state machines. Doctoral thesis Rep. BL-36 by Staff of ttarvard Computation Lab. to Bell Telephone Labs. 1964.
2. Quotients of Context-Free Languages
3. Ambiguity in context free languages
4. On the computational complexity of algorithms;Trans. Amer. Mash. Soc.,1965
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献