6533b820fe1ef96bd12790a3
RESEARCH PRODUCT
DEFECT THEOREMS FOR TREES
Sabrina MantaciJuhani Karhumäkisubject
Discrete mathematicsPrefixCombinatoricsSet (abstract data type)Combinatorics on wordsAlgebra and Number TheoryComputational Theory and MathematicsInformationSystems_INFORMATIONSTORAGEANDRETRIEVALRank (graph theory)Computer Science::Formal Languages and Automata TheoryInformation SystemsTheoretical Computer ScienceMathematicsdescription
We generalize different 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 prefix rank forms an exception.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2000-11-01 | Developments In Language Theory |