References

1. Valentin M. Antimirov (1996): Partial Derivatives of Regular Expressions and Finite Automaton Constructions. Theor. Comput. Sci. 155(2), pp. 291–319. Available at http://dx.doi.org/10.1016/0304-3975(95)00182-4.
2. Janusz A. Brzozowski (1964): Derivatives of Regular Expressions. J. ACM 11(4), pp. 481–494. Available at http://doi.acm.org/10.1145/321239.321249.
3. Jean-Marc Champarnaud & Djelloul Ziadi (2001): From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. IJAC 11(6), pp. 707–736. Available at http://dx.doi.org/10.1142/S0218196701000772.
4. Jean-Marc Champarnaud & Djelloul Ziadi (2002): Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1), pp. 137–163. Available at http://dx.doi.org/10.1016/S0304-3975(01)00267-5.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Loding, S. Tison & M. Tommasi (2007): Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata.
6. Corinna Cortes, Patrick Haffner & Mehryar Mohri (2004): Rational Kernels: Theory and Algorithms. Journal of Machine Learning Research 5, pp. 1035–1062. Available at http://www.ai.mit.edu/projects/jmlr/papers/volume5/cortes04a/cortes04a.pdf.
7. Pedro García, Damián López, José Ruiz & Gloria Inés Alvarez (2011): From regular expressions to smaller NFAs. Theor. Comput. Sci. 412(41), pp. 5802–5807. Available at http://dx.doi.org/10.1016/j.tcs.2011.05.058.
8. V.-M. Glushkov (1961): The abstract theory of automata. Russian Mathematical Surveys 16, pp. 1–53.
9. Lucian Ilie & Sheng Yu (2003): Follow automata. Inf. Comput. 186(1), pp. 140–162. Available at http://dx.doi.org/10.1016/S0890-5401(03)00090-7.
10. Ahmed Khorsi, Faissal Ouardi & Djelloul Ziadi (2008): Fast equation automaton computation. J. Discrete Algorithms 6(3), pp. 433–448. Available at http://dx.doi.org/10.1016/j.jda.2007.10.003.
11. Dietrich Kuske & Ingmar Meinecke (2011): Construction of tree automata from regular expressions. RAIRO - Theor. Inf. and Applic. 45(3), pp. 347–370. Available at http://dx.doi.org/10.1051/ita/2011107.
12. Éric Laugerotte, Nadia Ouali Sebti & Djelloul Ziadi (2013): From Regular Tree Expression to Position Tree Automaton. In: Adrian Horia Dediu, Carlos Martín-Vide & Bianca Truthe: LATA, Lecture Notes in Computer Science 7810. Springer, pp. 395–406. Available at http://dx.doi.org/10.1007/978-3-642-37064-9_35.
13. R. McNaughton & H. Yamada (1960): Regular Expressions and State Graphs for Automata. IEEE Trans. on Electronic Computers 9, pp. 39–47.
14. Ludovic Mignot, Nadia Ouali Sebti & Djelloul Ziadi (2014): An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations. In: A. Beckmann, E. Csuhaj varjù & K. Meer (Eds.): Computability in Europe- 10th International Conference, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings, Lecture Notes in Computer Science 8493. Springer, pp. 303–313.
15. Ludovic Mignot, Nadia Ouali Sebti & Djelloul Ziadi (2014): An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations. CoRR abs/1401.5951.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org