Defect Theorems for Trees


We generalize di erent notions of a rank of a set of words to sets of trees. We prove that almost all of those ranks can be used to formulate a defect theorem. However, as we show, the pre x rank forms an exception. TUCS Research Group Mathematical Structures of Computer Science

DOI: 10.3233/FI-1999-381210

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@article{Karhumki1999DefectTF, title={Defect Theorems for Trees}, author={Juhani Karhum{\"a}ki and Sabrina Mantaci}, journal={Fundam. Inform.}, year={1999}, volume={38}, pages={119-133} }