“…(ii) The complete information about each word A max ( , m) and the path connecting it with its root word is encoded in the generalized continued fraction S( , m) (2). In particular, the unique root ( , m ) associated with a given pair ( , m), and also the nodes and edges of the path connecting both points can be computed explicitly by the expansion (see (9), (11) and (13) below).…”