Comparing the Succinctness of Monadic Query Languages Over Finite Trees
RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita:2004017
Full Text
Open PDFAbstract
Available in full text
Date
October 1, 2004
Authors
Publisher
EDP Sciences