Definition 1. A word-relation presentation over an alphabet is a pair of a replacement relation and a zero set given by (2): (2)✦ The replacement reachability relation on associated with is the monoid congruence closure defined by (3): (3)✦ A word vanishes in , written , under the condition (4): (4)✦ For a ring , let and from (1); the presented -algebra of is the quotient ring given by (5): (5)✦
The space of cell metadata of bound ten is given by (6): (6)✦ with default metadata ✦ and task projection .✦ Using from (6), for the alphabet of finite-table cells consists of quintuples described by (7): (7)✦ For , write , , , , , and for the components of , and ; call a core cell when for some ✦, a palette cell when for some ✦, and head-free when is not active-headed and for all .✦ Reading an address from a cell gives , equal to when , , , and , equal to when , , , and , and otherwise; for a clause , the register delta has -th entry .
For , , , , , , and , update operations define cells in as follows: sets checker state to ✦; sets position to ✦; sets skeleton marker to and head to ✦; and for , sets skeleton marker to and head to , sets skeleton marker to and head to , and keeps and while setting skeleton marker to , metadata to , data to , certificate to , and head to .
Relative to a schedule on and a bound , a cell is formatted when: is admissible; whenever is not a palette cell; identically whenever with ; and whenever is not a core cell; , , , and whenever ; whenever ; , , and whenever ; whenever is active-headed and ; and whenever , one has if , if , and terminal if is an endpoint phase. Two cells satisfy checker compatibility when is palette-compatible whenever both are palette cells and satisfies the terminal checker condition whenever is a palette cell and ✦; a pair of cells forms a compatible cell pair when is a compatible skeleton pair and is checker-compatible.
Given a schedule on , the directed single-cell transition relation on is the binary relation generated for , , , and by: when is initial, , , and ; and when is terminal, , , , , , when , when , when , and when .
Directed two-cell transitions on are generated for , , , and by: when is a compatible skeleton pair; writing , the four moves , , , and when is a compatible skeleton pair; when with , is a palette cell, and ; when , is a palette cell, and ; and when , , , and both and are head-free. For a schedule on and a bound , the cell replacement relation on is the binary relation holding for cell words when every cell occurring in or is formatted for and either , with or , or , with or .
A cell is a semantic zero for , written , when and either with , or with , or with . For a schedule on and a bound , the unary zero predicate on holds for a cell when fails formatting for , holds, or and for some . The binary zero relation on holds for a cell pair when fails to be a compatible cell pair, for some , or , , and for some .
For , write ; the alphabet of raw bit vectors of width is given by (8): (8)✦ Assign integer tags to positions via , , (with index , , or ), to markers via , to checker states via tags (with index ), and to the nine phases in order via . For , let place position tag, position index, marker tag, , , checker tag, checker index, , and phase tag of in entries to and in entries to , and let place , , , , , and for in entries to and in entries to . Given and , the writer sets index to the -th binary bit (as for and for ) of for , to for , and to for ✦; the cell encoding map is defined by (9): (9)✦
For and , writing and , the partial parser reads little-endian -bit integers for and flags for , returning the cell in whose integer and flag entries match and (applying to ) whenever (with if and if ), , , , (with if and otherwise), , and , and undefined otherwise. Using (9), the partial decoding map is defined by (10): (10)✦ with letterwise lift . For a schedule on and , raw replacement is the binary relation on holding for words when and are defined and satisfy ; raw unary zero is the predicate on holding for when is undefined or with ; raw binary zero is the relation on holding for when and are defined with ; and is the subset of consisting of words with and with . Using (2) and (10), for a schedule on and a bound , the raw word-algebra presentation over is given by (11): (11)✦
For , the cell cut predicate on holds for a cell when (12) holds: (12)✦ At parameter , the raw cut predicate on holds for a raw vector when (13) holds: (13)✦
For , , a bit vector , and a position , the canonical cell has skeleton , checker , certificate , head , , and when with and otherwise; concatenating for , then for , and finally gives the canonical block of length , and concatenating over a word with gives the cell-word encoding . For , writing and for letterwise applications to words, the hierarchy embedding is defined by (14): (14)✦
In the paper, the result reads: presentations of associative algebras by words have elementary replacements between nonempty words of equal length and zero declarations with nonempty; at parameter with , letters in (written ) carry structural types , , , transaction and palette-checker tracks, and data bits; and a clean block has both tracks idle and each palette color once, while a canonical block has colors in increasing order, giving (written for data size ) of length .