Abstract
In this paper, the sets of n-valued serial sequences are considered. The structure of such series is defined by constraints on the number of series, the length of series, and the height of series. The problem of recalculation, numeration, and generation is solved for the sets of ascending, descending, and one-transitive sequences with constant differences in the adjacent series heights.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
