MIT Press

Figure 3:

A node ν with label in Nℓ × Nr translates to
configuration (d-1⋯d-k′,ē1⋯ēm′,T), via its shortest path to the root. The
overlined symbols denote the integers between 0 and n corresponding to d1⋯dk′e1⋯em′ ∈ p +s*.

A node ν with label in N_ℓ × N_r translates to configuration $({\bar{d}}_{1} \dots {\bar{d}}_{k^{'}}, ē_{1} \dots ē_{m^{'}}, T)$ ⁠, via its shortest path to the root. The overlined symbols denote the integers between 0 and n corresponding to d₁⋯d_k′e₁⋯e_m′ ∈ p⁺s^*.

This Feature Is Available To Subscribers Only

Sign In or Create an Account

This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.

Accept