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:

An upper bound on the complexity of recognizable tree languages

Olivier Finkel, Dominique Lecomte and Pierre Simonnet
RAIRO - Theoretical Informatics and Applications (2015)
https://doi.org/10.1051/ita/2015002

Computer Science Logic

Julian Bradfield, Jacques Duparc and Sandra Quickert
Lecture Notes in Computer Science, Computer Science Logic 3634 384 (2005)
https://doi.org/10.1007/11538363_27