Querying Unranked Trees with Stepwise Tree Automata-Reference-Cited by-同舟云学术

Querying Unranked Trees with Stepwise Tree Automata

Published:2004 Issue: Volume: Page:105-118
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Carme Julien,Niehren Joachim,Tommasi Marc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25979-4_8

Reference18 articles.

1. Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with Lixto. The Very Large Data Bases Journal, 119–128 (2001)

2. Berlea, A., Seidl, H.: Binary queries. In: Proceedings of Extreme Markup Languages, Montreal (2002)

3. Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical report (2001)

4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Online book, 450 pages. Available at (1997), http://www.grappa.univ-lille3.fr/tata

5. Courcelle, B.: On recognizable sets and tree automata. In: Ait-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, Algebraic Techniques, vol. 1, ch. 3, pp. 93–126. Academic Press, London (1989)

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

1. A Robust Theory of Series Parallel Graphs;Proceedings of the ACM on Programming Languages;2023-01-09

2. Schema-Based Automata Determinization;Electronic Proceedings in Theoretical Computer Science;2022-09-20

3. Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata;Computer Science – Theory and Applications;2020

4. Z-Automata for Compact and Direct Representation of Unranked Tree Languages;Implementation and Application of Automata;2019

5. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019