Complexity problems in real time languages†
References (9)
Tape-reversal bounded Turing machine computations
J. Computer System Sci.
(1968)On certain formal properties of grammars
Information and Control
(1959)Real time computation
Israel J. Math.
(1963)A machine-independent theory of the complexity of recursive functions
J. Assoc. Comput. Mach.
(1967)
There are more references available in the full text version of this article.
Cited by (4)
On the Representational Capacity of Recurrent Neural Language Models
2023, EMNLP 2023 - 2023 Conference on Empirical Methods in Natural Language Processing, ProceedingsAn optimal big data processing for smart grid based on hybrid MDM/R architecture to strengthening RE integration and EE in datacenter
2019, Journal of Ambient Intelligence and Humanized ComputingComplexity of algorithms and computations
1981, Journal of Soviet Mathematics
- †
Research supported by the National Science Foundation through the Electronics Research Laboratory at University of California, Berkeley under grants GK-2277 and GK-10656X.
Copyright © 1971 Published by Elsevier Inc.