Author:
Chytil Michal P.,Monien Burkhard
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Alt, H., Lower bounds on space complexity of context-free recognition, AI 12 (1979), 33–61
2. Brainerd, B., An analog of a theorem about context-free languages, Information and Control 11 (1968), 561–567
3. von Braunmuehl, B., Cook, S., Mehlhorn, K., Verbeek, R., The recognition of deterministic CFLs in small time and space, Information and Control 56 (1983), 34–51
4. Chytil, M., Crochemore, M., Monien, B., Rytter, W., On the parallel recognition of unambiguous context-free languages, submitted for publication
5. Chytil, M., Jakl, V., Serial composition of 2-way finite state transducers and simple programs on strings, Proc. of ICALP'77, LNCS 52, Springer-Verlag 1977, 135–147
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献