unary mekso operator: reverse ordered list/tuple X_{1}.

If X_{1 }= (x_{1, x}, then ze'ai'au(X_{1) }= (x_{n, x}; (note the casing). This is essentially equivalent to reindexing/permuting of indices in a specific way. If X_{1} is an empty list/tuple or is a singleton/one-element list/tuple, then the output is X_{1}. If X_{2} has infinitely many terms, then the result is indeed the reversal thereof, but accessing any given term becomes basically impossible without the usage of "ro". It is conceivable that this word might be able to be applied to comparison operators/ordering relations, strings, numeric strings (endianness switching), etc. as well.

- cpolinomi'a
- x
_{1}is a formal polynomial with coefficients x2 (ordered list) of degree x_{3}(li; nonnegative integer) over structure/ring x_{4}(to which coefficients x_{2}all belong) and in indeterminant x_{5}.