Author:
Martens Wim,Niehren Joachim
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)
2. Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3 (2001);
3. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology (2001)
4. Lecture Notes in Artificial Intelligence;J. Carme,2004
5. Lecture Notes in Computer Science;J. Carme,2004
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parsing Unranked Tree Languages, Folded Once;Algorithms;2024-06-19
2. Improving IDE code inspections with tree automata;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07
3. Z-Automata for Compact and Direct Representation of Unranked Tree Languages;Implementation and Application of Automata;2019
4. Program synthesis using abstraction refinement;Proceedings of the ACM on Programming Languages;2018-01
5. XML Types;Encyclopedia of Database Systems;2018