Author:
Kaminski Michael,Tan Tony
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Information and System 27(1), 21–39 (2002)
2. Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245–267 (1998)
3. Comon, H., et al.: Tree Automata Techniques and Applications (2005),
http://www.grappa.univ-lille3.fr/tata/
4. Doner, J.E.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406–451 (1970)
5. Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, pp. 683–688. IEEE Computer Society Press, Los Alamitos (1990)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献