Author:
Seynhaeve Franck,Tison Sophie,Tommasi Marc
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. A. Arnold and M. Dauchet. Morphismes et bimorphismes d’arbres. Theorical Computer Science, 20:33–93, 1982.
2. Lect Notes Comput Sci;B. Bogaert,1999
3. [CDG+97]_H. Comon, M. Dauchet, R. Gilleron,, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on:
http://www.grappa.univ-lille3.fr/tata
, 1997.
4. J.L. Coquidè, M. Dauchet, R. Gilleron, and S. Vágvolgyi. Bottom-up tree push-down automata: Classification and connection with rewrite systems. Theorical Computer Science, 127:69–98, 1994.
5. M. Dauchet, A.-C. Caron, and J.-L. Coquidè. Reduction properties and auto-mata with constraints. Journal of Symbolic Computation, 20:215–233, 1995.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献