Author:
Durand Irène,Sénizergues Géraud
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Lecture Notes in Computer Science;M. Benois,1987
2. Benois, M., Sakarovitch, J.: On the complexity of some extended word problems defined by cancellation rules. Inform. Process. Lett. 23(6), 281–287 (1986)
3. Book, R.V., Jantzen, M., Wrathall, C.: Monadic Thue systems. TCS 19, pp. 231–251 (1982)
4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), Draft available from http://www.grappa.univ
5. Cremanns, R., Otto, F.: Finite derivation type implies the homological finiteness condition FP3. J. Symbolic Comput. 18(2), 91–112 (1994)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献