1 paper
Kord Eickmeyer, Georg Schindling
We study the notion of sparseness for regular languages over finite trees and infinite words. A language of trees is called sparse if the relative number of n-node trees in the l…