Author:
Braunmühl Burchard von,Verbeek Rutger
Reference16 articles.
1. B.V. Braunmühl, S.A. Cook, K.R. Mehlhorn, Verbeek: The recognition of deterministic CFLs in small time and space, Inf. Contr. 56, pp. 34–51.
2. B.V. Braunmühl, R. Verbeek, : A recognition algorithm for DCFLs optimal in time and space, Proc. 21th FOCS, pp. 411–420.
3. S.A. Cook, : Deterministic CFLs are accepted simultaneously in polynomial time and log squared tape, Proc. 11th ACM-STOC, pp. 338–345.
4. S.A. Cook, R. Sethi, : Storage requirements for deterministic polynomial time recognizable languages. JCSS 13, 25–37.
5. Y. Igarashi, : The tape complexity of some classes of Szilard languages, SIAM 3. Comp. 6, pp. 46o-466.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献