Author:
Lellmann Björn,Pattinson Dirk
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. LNCS;A. Avron,2001
2. Ciabattoni, A., Leitsch, A.: Towards an algorithmic construction of cut-elimination procedures. Math. Struct. in Comp. Sci. 18(1), 81–105 (2008)
3. Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. Bulletin of the EATCS 52, 244–262 (1994)
4. Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical propositional logics. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol. 1071, pp. 210–225. Springer, Heidelberg (1996)
5. Lewis II, P.M., Stearns, R.E., Hartmanis, J.: Memory bounds for recognition of context-free and context-sensitive languages. In: FOCS, pp. 191–202 (1965)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献