Author:
Martens Wim,Niehren Joachim
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference36 articles.
1. Learning regular sets from queries and counterexamples;Angluin;Inform. and Comput.,1987
2. Incremental validation of XML documents;Balmin;ACM Trans. Database Systems,2004
3. A. Brüggemann-Klein, M. Murata, D. Wood, Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3, 2001, Technical Report HKUST-TCSC-2001-0, The Hong Kong University of Science and Technology, 2001
4. J. Carme, A. Lemay, J. Niehren, Learning node selecting tree transducers from completely annotated examples, in: International Colloquium on Grammatical Inference, ICGI 2004, 2004, pp. 91–102
5. J. Carme, J. Niehren, M. Tommasi, Querying unranked trees with stepwise tree automata, in: International Conference on Rewriting Techniques and Applications, RTA 2004, 2004, pp. 105–118
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献