Jorge L.C. Sanz
Pattern Recognition
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
Wei Zhang, Timothy Wood, et al.
ICAC 2014
Conference paper
A Comparison of End-to-End Decision Forest Inference Pipelines
Hong Guan, Saif Masood, et al.
SoCC 2023
Rudra M. Tripathy, Amitabha Bagchi, et al.
Intelligent Data Analysis