Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
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.
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR
Yixin Diao, Kevin M. Passino
IEEE Transactions on Fuzzy Systems
Dzung Phan, Vinicius Lima
INFORMS 2023