The Setting
Processing a periodic group concerns traversals of its actual layer windows. A connection to a recorded occurrence in a target layer has to fit within the traversal budget.
Let be a set of finite words over an alphabet . For an integer-indexed text and integers , the window is the finite word in (1); reversed endpoints give the empty word . (1) Two texts and have interval agreement on when for every integer with .✦
A hierarchical walk in is a finite concatenation of up steps appending a symbol and down steps deleting the first symbol, with both endpoints of every step in .✦ A stationary walk at a vertex of is allowed. A walk visits a word when that word is an actual vertex of the walk, including its endpoints.✦ Its cost is its number of up steps; stationary walks and down steps cost zero, and concatenation adds costs.✦ A loop is a hierarchical walk whose initial and final vertices coincide, with the same notions of visitation and cost.✦ For a hierarchical walk in , write for the set of words visited by .
A layer for a text and period parameter is a nondecreasing integer-valued exit function satisfying (2). Here and are its first and last exit positions, and is its content, the set of base layer vertices. (2)✦
A shifted record of a text in a layer of text is a triple of integers satisfying (3). (3)✦
The Definition
Definition 1. An ordered layer collection on , indexed by a set of groups, consists of texts , positive integers , and layers for and , where , satisfying (4). The chosen is a period parameter. (4)✦
The grouped layer index set is ✦; the indexed base layer at is .✦
When is linearly ordered, the forward rotation stream has the lexicographic order. A distinguished phase selects a greatest rotation✦, and is the greatest rotation rank, as in (5). (5)✦
For a group of an ordered layer collection , a threshold , an integer start and a nonnegative integer , the set of qualifying layer indices is the set in (6). (6)✦
Definition 2. A collection has a foreign record supply if every group , layer , integer and positive integer satisfying and admit an index and a record of in with the properties in (7). (7)✦
Definition 3. Assume that is linearly ordered. An outgoing block plan for an ordered layer collection consists of a source group , a nonempty finite set consisting of indices of group , a target , and a record of in such that . Put , and . The plan requires loops and satisfying the first two lines of (8). When , it also requires a loop and a word satisfying its last line. (8)✦
What Is Checked
The collection definition (4) is stated over an arbitrary group index set, with finitely many layers in each group. The supply condition (7) ranges over integer positions and positive block lengths; the plan definition (8) additionally uses a linear order on the alphabet.
For a shifted record in (3), the source window equals the target window and belongs to the content of the target layer.