Arthur Nádas
IEEE Transactions on Neural Networks
Paper
Real-Time Definable Languages
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. © 1967, ACM. All rights reserved.
Related
Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial Intelligence
Conference paper
On Trajectory Augmentations for Off-Policy Evaluation
Ge Gao, Qitong Gao, et al.
ICLR 2024
Matteo Baldoni, Nirmit Desai, et al.
AAMAS 2009