N-Ary Queries by Tree Automata-Reference-Cited by-同舟云学术

N-Ary Queries by Tree Automata

Published:2005 Issue: Volume: Page:217-231
ISSN:0302-9743
Container-title:Database Programming Languages
language:
Short-container-title:

Author:

Niehren Joachim,Planque Laurent,Talbot Jean-Marc,Tison Sophie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11601524_14.pdf

Reference21 articles.

1. Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with lixto. In: 28th International Conference on Very Large Data Bases, pp. 119–128 (2001)

2. Berlea, A., Seidl, H.: Binary queries for document trees. Nordic Journal of Computing 11(1), 41–71 (2004)

3. Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Journal of Comput. and Syst. Sci. 61(1), 1–50 (2000)

4. Bruggemann-Klein, A., Wood, D., Murata, M.: Regular tree and regular hedge languages over unranked alphabets: Version 1 (April 07, 2001)

5. Lecture Notes in Artificial Intelligence;J. Carme,2004

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MSO Queries on Trees;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

2. Monadic Decomposition;Journal of the ACM;2017-06-02

3. Two-Way Visibly Pushdown Automata and Transducers;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

4. Node Query Preservation for Deterministic Linear Top-Down Tree Transducers;IEICE Transactions on Information and Systems;2015

5. MSO queries on trees;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14