Author:
Holzer Markus,Kutrib Martin
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Ch. Bader and A. Moura. A generalization of Ogden’s lemma. Journal of the ACM, 29(2):404–407, 1982.
2. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.
3. J. Berstel. Transductions and Context-Free Languages, volume 38 of Leitfäden der angewandten Mathematik und Mechanik LAMM. Teubner, 1979.
4. N. Chomsky. Handbook of Mathematic Psychology, volume 2, chapter Formal Properties of Grammars, pages 323–418. Wiley & Sons, New York, 1962.
5. S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4–18, January 1971.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献