Author:
Geser Alfons,Hofbauer Dieter,Waldmann Johannes
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference24 articles.
1. Berstel, J.: Transductions and Context-Free Languages, Teubner, Stuttgart, 1979.
2. Book, R. V. and Otto, F.: String-Rewriting Systems, Texts Monogr. Comput. Sci. Springer-Verlag, New York, 1993.
3. Coquand, T. and Persson, H.: A proof-theoretical investigation of Zantema’s problem, in M. Nielsen and W. Thomas (eds.), Proc. 11th Annual Conf. of the EACSL CSL-97, Lecture Notes in Comput. Sci., Vol. 1414, Springer-Verlag, 1998, pp. 177–188.
4. Dershowitz, N.: Termination of rewriting, J. Symb. Comput. 3(1–2) (1987), 69–115.
5. Dershowitz, N. and Hoot, C.: Topics in termination, in C. Kirchner (ed.), Proc. 5th Int. Conf. Rewriting Techniques and Applications RTA-93, Lecture Notes in Comput. Sci., Vol. 690, Springer-Verlag, 1993, pp. 198–212.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献