Finite semigroup presentation
= Finite semigroup presentation
A semigroup presentation is finite when both its generator set and its list of defining equalities are finite. A finite transition table for a <Turing machine> can be encoded this way: state-and-tape words simulate transitions, boundary rules supply blank cells, and halting-state rules erase the configuration to one distinguished symbol.