From Regular Tree Expression to Position Tree Automaton-Reference-Cited by-同舟云学术

From Regular Tree Expression to Position Tree Automaton

Published:2013 Issue: Volume: Page:395-406
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Laugerotte Éric,Sebti Nadia Ouali,Ziadi Djelloul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-37064-9_35

Reference10 articles.

1. Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science 155, 291–319 (1996)

2. Bruggemann-Klein, A.: Regular expressions into finite automata. Theoretical Computer Science 120, 197–213 (1993)

3. Chang, C.H., Paige, R.: From regular expressions to DFAs using compressed NFAs. Theoretical Computer Science 178, 136 (1997)

4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Loding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (October 2007), http://www.grappa.univ-lille3.fr/tata

5. Cortes, C., Haffner, P., Mohri, M.: Rational kernels: Theory and algorithms. Journal of Machine Learning Research 5, 1035–1062 (2004)

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

1. The Bottom-Up Position Tree Automaton and the Father Automaton;International Journal of Foundations of Computer Science;2020-12

2. An Efficient Algorithm for the Construction of the Equation Tree Automaton;International Journal of Foundations of Computer Science;2018-09

3. From Tree Automata to Rational Tree Expressions;International Journal of Foundations of Computer Science;2018-09

4. Tree pattern matching from regular tree expressions;Kybernetika;2018-04-28

5. The Bottom-Up Position Tree Automaton and Its Compact Version;Implementation and Application of Automata;2018