The computation of an SL_{2} automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |-_{A} and which starts with the initial con?guration of A on w: (p_{1},w_{1}), where p_{1} . w_{1} = ?w?.
Since w is ?nite, the computation of A on w will be ?nite. Since it is required to be maximal, the last ID will be one that does not directly compute any other ID. This will either be of the form (σ_{i}σ_{j}) , wii where σiσj ∈ T, or of the form (σ_{n}?, ε), in which σ_{n}? ∈ T but all the input has been consumed. In the ?rst case we will say that the computation is rejecting (or that it crashes). In the second we will say that it is accepting. Note that we have adopted the convention that the automaton halts with FALSE as soon as it encounters a pair of symbols that are not in T.