Algorithms for Producing and Ordering Lexical and Nonlexical Sequences out of one Element

TL;DR

This paper introduces algorithms for generating and ordering lexical and nonlexical sequences based on elementary operations, providing a main theorem that determines when two lexical sequences are adjacent.

Contribution

It presents new algorithms and a main theorem for adjacency of lexical sequences, advancing sequence ordering methods.

Findings

Main theorem characterizes adjacency of lexical sequences

Algorithms for producing sequences of a given degree

Framework for ordering lexical and nonlexical sequences

Abstract

This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of "elementary operations" on positive integral sequences is introduced. Our main theorem answers the question of when two lexical sequences are adjacent.