Author:
Holzer Markus,Kutrib Martin,Leiter Ursula
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aho, A.V.: Indexed grammars–An extension of context-free grammars. J. ACM 15, 647–671 (1968)
2. Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Planar and grid graph reachability problems. Theoret. Comput. Sci. 45, 675–723 (2009)
3. Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)
4. Barrett, C.L., Jacob, R., Marathe, M.V.: Formal-language-constrained path problems. SIAM J. Comput. 30, 809–837 (2000)
5. Beeri, C.: Two-way nested stack automata are equivalent to two-way stack automata. J. Comput. System Sci. 10 (1975)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献