Rie Kubota Ando
CoNLL 2006
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
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Yale Song, Zhen Wen, et al.
IJCAI 2013
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022