Author:
Fischer Patrick C.,Meyer Albert R.,Rosenberg Arnold L.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference14 articles.
1. A. Cobham, Time and memory capacity bounds for machines which recognize squares or palindromes,IBM Research Report RC-1621, 1966.
2. P. C. Fischer, Turing machines with restricted memory access.Information and Control 9 (1966), 364–379.
3. M. J. Fischer andA. L. Rosenberg, Real-time solutions of the origin-crossing problem.Math. Systems Theory 2 (1968), 257–263.
4. S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
5. S. Ginsburg andE. H. Spanier, BoundedAlgol-like languages,Trans. Amer. Math. Soc. 113 (1964), 333–368.
Cited by
138 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Secure compilation of rich smart contracts on poor UTXO blockchains;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08
2. BVAP: Energy and Memory Efficient Automata Processing for Regular Expressions with Bounded Repetitions;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2;2024-04-27
3. Languages generated by numerical P systems with thresholds;Theoretical Computer Science;2024-03
4. What Formal Languages Can Transformers Express? A Survey;Transactions of the Association for Computational Linguistics;2024
5. Reversible Computations of One-Way Counter Automata;RAIRO - Theoretical Informatics and Applications;2024