RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

An upper bound on the complexity of recognizable tree languages

Olivier Finkel, Dominique Lecomte and Pierre Simonnet

RAIRO-Theor. Inf. Appl., 49 2 (2015) 121-137

Published online: 27 April 2015

DOI: 10.1051/ita/2015002

Olivier Finkel

Dominique Lecomte

Pierre Simonnet

Articles written by ALL the selected authors (AND)

Articles written by ANY OF the selected authors (OR)