Abstract
Sets of n-valued finite serial sequences are investigated. Such a sequence consists of two serial subsequences, beginning with an increasing subsequence and ending in a decreasing one (and vice versa). The structure of these sequences is determined by constraints imposed on the number of series, on series lengths, and on series heights. For sets of sequences the difference between adjacent series heights in which does not exceed a certain given value 1 ≤ |h j+1 − h j | ≤ δ, two algorithms are constructed of which one assigns smaller numbers to lexicographically lower sequences and the other assigns smaller numbers to lexicographically higher sequences.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
