Author:
Dassow Jürgen,Lange Klaus-Jörn
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. C. Beeri, Two-way nested stack automata are equivalent to two-way stack automata. J.Comp.Syst.Sci. 10 (1975) 317–339.
2. S. Buss, The Boolean formula value problem is in ALOGTIME. Proc. 19th STOC, 123–131, 1987.
3. S. Cook, Characterizations of pushdown machines in terms of time bounded computers. J.Assoc.Comp.Mach. 18 (1971) 4–18.
4. J. Engelfriet, Context-free grammars with storages. Techn. Report 86-11, University of Leiden, Department of Computer Science.
5. J. Engelfriet and H.J. Hoogeboom, Automata with storage on infinite words. LNCS 372, 289–303.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献