Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Algebras of generalized tree languages with fixed variables

Sarawut Phuapong, Nagornchat Chansuriya and Thodsaporn Kumduang
Algebra and Discrete Mathematics 36 (2) 202 (2023)
https://doi.org/10.12958/adm2013

Bottom-Up derivatives of tree expressions

Samira Attou, Ludovic Mignot, Djelloul Ziadi, Markus Holzer and José M. Sempere
RAIRO - Theoretical Informatics and Applications 55 4 (2021)
https://doi.org/10.1051/ita/2021008

The Bottom-Up Position Tree Automaton and the Father Automaton

Samira Attou, Ludovic Mignot and Djelloul Ziadi
International Journal of Foundations of Computer Science 31 (08) 1051 (2020)
https://doi.org/10.1142/S0129054120420034

An Efficient Algorithm for the Construction of the Equation Tree Automaton

Ludovic Mignot, Nadia Ouali-Sebti and Djelloul Ziadi
International Journal of Foundations of Computer Science 29 (06) 951 (2018)
https://doi.org/10.1142/S0129054118500156

Rewriting Logic and Its Applications

Thomas Genet, Tristan Gillard, Timothée Haudebourg and Sébastien Lê Cong
Lecture Notes in Computer Science, Rewriting Logic and Its Applications 11152 153 (2018)
https://doi.org/10.1007/978-3-319-99840-4_9

K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions

Ludovic Mignot, Nadia Ouali Sebti and Djelloul Ziadi
Electronic Proceedings in Theoretical Computer Science 151 327 (2014)
https://doi.org/10.4204/EPTCS.151.23

Language and Automata Theory and Applications

Éric Laugerotte, Nadia Ouali Sebti and Djelloul Ziadi
Lecture Notes in Computer Science, Language and Automata Theory and Applications 7810 395 (2013)
https://doi.org/10.1007/978-3-642-37064-9_35