Author:
Braunmühl Burchard,Verbeek Rutger
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Book, R.V., Greibach, S.A. Quasi-realtime languages, Mathematical Systems Theory 4 (1970), 97–111.
2. Hibbard, T.N. A generalization of context-free determinism, Information and Control 11 (1967), 196–238.
3. Lewis II, P.M., Stearns, R.E., Hartmanis, J. Memory bounds for the recognition of contextfree and contextsensitive languages, IEEE Conf.Rec. on Switching Circuit Theory and Logical Design (1965), 191–202.
4. Karp, R.M. Reducibilities among combinatorial problems, in: Miller & Thatcher: Complexity of computer computations, New York 1972, 85–104.
5. Savitch, W.J. Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences 4 (1970), 177–192.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献