Author:
Bertoni Alberto,Mereghetti Carlo,Pighizzini Giovanni
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. A language over a one symbol alphabet requiring only O(log log n) space;Alt;SIGACT News,1975
2. An Introduction to the Theory of Numbers;Hardy,1979
3. Hierarchies of memory limited computations;Hartmanis;IEEE Conf. Record on Switching Circuit Theory and Logical Design,1965
4. One-tape, off-line Turing machine computations;Hennie;Inform. and Control,1965
5. Some results on tape-bounded Turing machines;Hopcroft;J. ACM,1969
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Push Complexity: Optimal Bounds and Unary Inputs;Lecture Notes in Computer Science;2024
2. Binary Coded Unary Regular Languages;Implementation and Application of Automata;2023
3. New Results on the Minimum Amount of Useful Space;International Journal of Foundations of Computer Science;2016-02
4. Restricted Turing Machines and Language Recognition;Language and Automata Theory and Applications;2016
5. TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES;International Journal of Foundations of Computer Science;2013-12