ParseWords 1.01

documentation notebook
Eric Rowland
​https://ericrowland.github.io/packages.html

Introduction

ParseWords is a package for studying parse words of pairs of binary trees under a certain grammar related to the four color theorem.
This introduction gets you started with a few features of the package; the next section provides a complete list of package symbols along with their usage messages and further examples.
ParseWords uses functions from my package BinaryTrees, so you will need to have BinaryTrees installed as well.
To use ParseWords, first you will need to load the package by evaluating the following cell. (If you need help, see loading a package.)
<<ParseWords`

Representing trees


Parse words


Package symbols

AllParseWords


BottomLeafDisjointQ


BottomLeafLabels


CanonicalWord


ConsecutiveLeafPairs


DecomposeTrees


IndecomposableQ


LabelLeaves


LabelTree


MutuallyCrookedQ


ParentLabel


ParseWords


RootLabel


SiblingLabel


WeaklyMutuallyCrookedQ
