Jayadeva, Sameena Shah, et al.
Swarm Intelligence
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.
Jayadeva, Sameena Shah, et al.
Swarm Intelligence
P.C. Yue, C.K. Wong
Journal of the ACM
Gang Liu, Michael Sun, et al.
ICLR 2025
Imran Nasim, Melanie Weber
SCML 2024