\documentclass[12pt,twoside]{article} 
\renewcommand{\baselinestretch}{1} 
\setcounter{page}{1} 
\setlength{\textheight}{21.6cm} 
\setlength{\textwidth}{14cm} 
\setlength{\oddsidemargin}{1cm} 
\setlength{\evensidemargin}{1cm} 
\pagestyle{myheadings} 
\thispagestyle{empty}
\markboth{\small{John Nixon}}{\small{Turing Machines}}
%\date{2017-02-21} 
\usepackage{caption}
\usepackage{verbatim} %allows some sections to be temporarily commented out, which was %useful for correcting compilation errors that caused a problem with the long captions in two
%tables (search for 'comment' to find them)

\usepackage{amssymb}
\usepackage{longtable}
\usepackage{float}
\usepackage{subfigure}
\usepackage{multirow}
\usepackage{bigstrut}
\usepackage{bigdelim}
%\usepackage{cmll}
\usepackage{pifont}
\usepackage[utf8]{inputenc}% add accented characters directly
\restylefloat{figure}
\restylefloat{table}
\usepackage{booktabs}
\usepackage{hyperref}%The inclusion of package hyperref converts all the references to equations etc. to internal links
\usepackage{array}
\usepackage{mathtools}% includes amsmath
\usepackage{amscd}
\usepackage{amsthm}
%\usepackage{MnSymbol}
\everymath{\mathtt{\xdef\tmp{\fam\the\fam\relax}\aftergroup\tmp}}
\everydisplay{\mathtt{\xdef\tmp{\fam\the\fam\relax}\aftergroup\tmp}}


\begin{document}
\setbox0\hbox{$x$}
\newcommand{\un}{\underline}
%\centerline{\bf Mathematica Aeterna, Vol. x, 201x, no. xx, xxx - xxx}%uncomment this in published version
Date: 2020-03-19
\centerline{} 
\centerline{} 
\centerline {\Large{\bf Turing Machines}}
\centerline{}
 

%\centerline{\bf {John Nixon}} 

%\centerline{} 

%\centerline{Brook Cottage} 

%\centerline{The Forge, Ashburnham} 

%\centerline{Battle, East Sussex} 

%\centerline{TN33 9PH, U.K.}


%Email: John.h.nixon1@gmail.com

%Date: 2017-01-11

\newtheorem{Theorem}{\quad Theorem}[section]
\newtheorem{Definition}[Theorem]{\quad Definition} 
\newtheorem{Corollary}[Theorem]{\quad Corollary} 
\newtheorem{Lemma}[Theorem]{\quad Lemma} 
\newtheorem{Example}[Theorem]{\quad Example} 
\newtheorem{alg}[Theorem]{\quad Algorithm}
\newcounter{Hypothesis}
\newtheorem{hyp}[Hypothesis]{Hypothesis}

\begin{abstract}
to be added
\end{abstract}
{\bf Mathematics Subject Classification:} 68Q25 \\ 

{\bf Keywords:} Turing machine
Comments are welcome. Please send them to
john.h.nixon1@gmail.com

This document is a work in progress. As such it is incomplete and still has errors and omissions. When brought to a state where I cannot easily find any improvements it will form my next paper on Turing Machine analysis. 

Theorem 4.1 has been added and this will remove some unnecessary duplication. The worked examples in section 7 need to be looked at again as do the lists of results in section 8.

A lot of the old material is now after the references so it can be viewed with links that still work but will probably not be in the paper.

This version of the paper has a new version of the program linked to it \cite{tie_v3_0_draft}, (the old version is \cite{tie}). It now creates Table 6 correctly. Note that the numbering of the IRR outlines is different from the paper. For values between 1 and 68: add 132 to get program output. For values between 1 and 133 inclusive: subtract 1. The reason for this is that the Tables 2 and the equivalent with the dots on the left were calculated together in the program. 

The final section on reverse rules might only be needed in a simplified form. A lot of material has been removed to 2017's 
\href{http://www.bluesky-home.co.uk/2017_Turing_notes.pdf}{Notes on Turing Machines}. These notes are now mostly superseded, but there may be a little there that is of use.
\section{The (5,5) TM and the first steps for its analysis: generating its irreducible regular rules (IRR) up to length 3}
This document describes my analysis techniques applied to the following Turing Machine

\begin{equation}\label{1}
\begin{tabular}{lllll}
$1\un{a}\to 2\_d$&$2\un{a}\to 1c\_$&$3\un{a}\to 4c\_$&$4\un{a}\to 3\_b$&$5\un{a}\to 2\_e$\\
$1\un{b}\to 4\_d$&$2\un{b}\to 4\_c$&$3\un{b}\to 4\_c$&$4\un{b}\to 4b\_$&$5\un{b}\to 3\_e$\\
$1\un{c}\to 3\_a$&$2\un{c}\to 1d\_$&$3\un{c}\to 2\_a$&$4\un{c}\to 3c\_$&$5\un{c}\to 3a\_$\\
$1\un{d}\to 2b\_$&$2\un{d}\to 1a\_$&$3\un{d}\to 5\_c$&$4\un{d}\to 5\_c$&$5\un{d}\to 4\_a$\\
$1\un{e}\to 2b\_$&$2\un{e}\to 3\_c$&$3\un{e}\to 3b\_$&$4\un{e}\to 5a\_$&$5\un{e}\to 3a\_$\\
\end{tabular}
\end{equation}

(TM) which was generated randomly with 5 states and 5 symbols. This TM, being much larger than any that I have analysed before, has proved to be a much more challenging case and will help me refine the procedures for efficiently generating the irreducible regular rules (IRR) from a TM that allowed understandable descriptions of the behaviour of smaller TM's to be found.

By looking for backward TM steps as described previously in \cite{jhn2017}, the following summary is obtained:
\begin{equation}\label{rev1}\begin{array}{l@{\hspace{5em}}l}
1\_\alpha\leftarrow\emptyset & 1\alpha\_\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}2\un{d}\\
\stackrel{\alpha=c}{\leftarrow}2\un{a}\\
\stackrel{\alpha=d}{\leftarrow}2\un{c}\\
\end{array}\right. \\[\dimexpr-\normalbaselineskip+10pt]
2\_\alpha\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}3\un{c}\\
\stackrel{\alpha=d}{\leftarrow}1\un{a}\\
\stackrel{\alpha=e}{\leftarrow}5\un{a}\\
\end{array}\right. & 2\alpha\_\stackrel{\alpha=b}{\leftarrow}\left\{\begin{array}{l}1\un{d}\\1\un{e}\end{array}\right. \\[25pt]
3\_\alpha\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}1\un{c}\\
\stackrel{\alpha=b}{\leftarrow}4\un{a}\\
\stackrel{\alpha=c}{\leftarrow}2\un{e}\\
\stackrel{\alpha=e}{\leftarrow}5\un{b}\\
\end{array}\right. &
3\alpha\_\left\{\begin{array}{cc}
\stackrel{\alpha=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}\\5\un{e}\end{array}\right.\\
\stackrel{\alpha=b}{\leftarrow}3\un{e}\\
\stackrel{\alpha=c}{\leftarrow}4\un{c}\\
\end{array}\right.\\[30pt]
4\_\alpha\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}5\un{d}\\
\stackrel{\alpha=c}{\leftarrow}\left\{\begin{array}{l}2\un{b}\\3\un{b}\end{array}\right. \\
\stackrel{\alpha=d}{\leftarrow}1\un{b}\end{array}\right. &
4\alpha\_\left\{\begin{array}{l}
\stackrel{\alpha=b}{\leftarrow}4\un{b}\\
\stackrel{\alpha=c}{\leftarrow}3\un{a}\\
\end{array}\right.\\[30pt]
5\_\alpha\stackrel{\alpha=c}{\leftarrow}\left\{\begin{array}{l}3\un{d}\\4\un{d}\end{array}\right. &
5\alpha\_\stackrel{\alpha=a}{\leftarrow}4\un{e}\\
\end{array}
\end{equation}
By adding an arbitrary symbol at the pointer to the LHS's of \eqref{rev1}, reachability (in the sense described in \cite{jhn2017}) of these can be assured, but do these generate IRR's of length 2? 
This is true if the forward computation has as its first step a move to the other position with a symbol rather than going beyond the string. This ensures that this forward computation generates an irreducible rule regardless of whether the pointer ends up at the left or right. This condition determines the set of symbols $\alpha_2$ in each case in the following.
\begin{equation}\label{rev2}
\begin{array}{l@{\hspace{3em}}l}
1\alpha_1\un{\alpha_2}\left\{\begin{array}{l}
\stackrel{\alpha_1=a}{\leftarrow}2\un{d}\alpha_2\\
\stackrel{\alpha_1=c}{\leftarrow}2\un{a}\alpha_2\\
\stackrel{\alpha_1=d}{\leftarrow}2\un{c}\alpha_2\\
\end{array}\right.
\text{ for }\alpha_2\in\{a,b,c\}&
2\un{\alpha_2}\alpha_1\left\{\begin{array}{l}
\stackrel{\alpha_1=a}{\leftarrow}3\alpha_2\un{c}\\
\stackrel{\alpha_1=d}{\leftarrow}1\alpha_2\un{a}\\
\stackrel{\alpha_1=e}{\leftarrow}5\alpha_2\un{a}\\
\end{array}\right.\text{ for }\alpha_2\in\{a,c,d\}\\[25pt]
2b\un{\alpha_2}\leftarrow\left\{\begin{array}{l}1\un{d}\alpha_2\\1\un{e}\alpha_2\end{array}\right.\text{ for }\alpha_2\in\{b,e\}&3\un{\alpha_2}\alpha_1\left\{\begin{array}{l}
\stackrel{\alpha_1=a}{\leftarrow}1\alpha_2\un{c}\\
\stackrel{\alpha_1=b}{\leftarrow}4\alpha_2\un{a}\\
\stackrel{\alpha_1=c}{\leftarrow}2\alpha_2\un{e}\\
\stackrel{\alpha_1=e}{\leftarrow}5\alpha_2\un{b}\\
\end{array}\right.\text{ for }\alpha_2\in\{a,e\}\\[30pt]
3\alpha_1\un{\alpha_2}\left\{\begin{array}{l}
\stackrel{\alpha_1=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}\alpha_2\\5\un{e}\alpha_2\end{array}\right.\\[10pt]
\stackrel{\alpha_1=b}{\leftarrow}3\un{e}\alpha_2\\
\stackrel{\alpha_1=c}{\leftarrow}4\un{c}\alpha_2
\end{array}\right.\text{ for }\alpha_2\in\{b,c,d\} &
4\un{\alpha_2}\alpha_1\left\{\begin{array}{l}
\stackrel{\alpha_1=a}{\leftarrow}5\alpha_2\un{d}\\
\stackrel{\alpha_1=c}{\leftarrow}\left\{\begin{array}{l}2\alpha_2\un{b}\\3\alpha_2\un{b}\end{array}\right.\\
\stackrel{\alpha_1=d}{\leftarrow}1\alpha_2\un{b}\end{array}\right.\text{ for }\alpha_2\in\{b,c,e\}\\[35pt]
4\alpha_1\un{\alpha_2}\left\{\begin{array}{l}
\stackrel{\alpha_1=b}{\leftarrow}4\un{b}\alpha_2\\
\stackrel{\alpha_1=c}{\leftarrow}3\un{a}\alpha_2\\
\end{array}\right.\text{ for }\alpha_2\in\{a,d\} &
5\un{\alpha_2}c\leftarrow\left\{\begin{array}{l}3\alpha_2\un{d}\\4\alpha_2\un{d}\end{array}\right.\text{ for }\alpha_2\in\{c,e\}\\[20pt]
5a\un{\alpha_2}\leftarrow 4\un{e}\alpha_2\text{ for }\alpha_2\in\{a,b,d\}\\
\end{array}
\end{equation}
The irreducible forward computations referred to above are as follows. These are therefore the IRR of length 2 for TM1 defined in \eqref{1}.
\begin{equation}\label{irr2}\begin{tabular}{lllll}
$1a\un{a}\to 2cb\_$ & $1c\un{a}\to 2db\_$ & $1d\un{a}\to 2ab\_$ & $1a\un{b}\to 3\_bd$ & $1c\un{b}\to 2db\_$\\ $1d\un{b}\to 5\_cd$ & $1a\un{c}\to 2\_ab$ & $1c\un{c}\to 2\_aa$ & $1d\un{c}\to 5\_ca$ & $2\un{a}a\to 2db\_$\\
$2\un{a}d\to 2cb\_$ & $2\un{a}e\to 2cb\_$ & $2\un{c}a\to 2ab\_$ & $2\un{c}d\to 2db\_$ & $2\un{c}e\to 2db\_$\\ $2\un{d}a\to 2cb\_$ & $2\un{d}d\to 2ab\_$ & $2\un{d}e\to 2ab\_$ & $2b\un{b}\to 3bc\_$ & $2b\un{e}\to 4\_cc$\\
$3\un{a}a\to 2\_ab$ & $3\un{a}b\to 4cb\_$ & $3\un{a}c\to 3cc\_$ & $3\un{a}e\to 5ca\_$ & $3\un{e}a\to 4bc\_$\\ $3\un{e}b\to 3bc\_$ & $3\un{e}c\to 4\_ca$ & $3\un{e}e\to 3bb\_$ & $3a\un{b}\to 3\_bc$ & $3b\un{b}\to 3bc\_$\\ $3c\un{b}\to 2ab\_$ & $3a\un{c}\to 2db\_$ & $3b\un{c}\to 4\_ca$ & $3c\un{c}\to 2ab\_$ & $3a\un{d}\to 2\_ec$\\ $3b\un{d}\to 3\_ec$ & $3c\un{d}\to 2db\_$ & $4\un{b}a\to 4\_cb$ & $4\un{b}c\to 3bc\_$ & $4\un{b}d\to 3\_ec$\\
$4\un{c}a\to 4cc\_$ & $4\un{c}c\to 2ab\_$ & $4\un{c}d\to 2db\_$ & $4\un{e}a\to 2cb\_$ & $4\un{e}c\to 3aa\_$\\
$4\un{e}d\to 3\_ba$ & $4b\un{a}\to 4\_cb$ & $4c\un{a}\to 2\_ab$ & $4b\un{d}\to 3\_ec$ & $4c\un{d}\to 2db\_$\\
$5\un{c}c\to 2db\_$ & $5\un{e}c\to 2db\_$ & $5a\un{a}\to 2cb\_$ & $5a\un{b}\to 5ca\_$ & $5a\un{d}\to 3\_ba$\\
\end{tabular}\end{equation}
Taking the first case in \eqref{rev2} namely $1a\un{\alpha_2}\leftarrow 2\un{d}\alpha_2$ and continuing the calculation forward as in \eqref{irr2} gives
\begin{equation}\label{eq5}\begin{array}{l}2\un{d}a\to 1a\un{a}\to 2cb\_\\2\un{d}b\to 1a\un{b}\to 3\_bd\\2\un{d}c\to 1a\un{c}\to 2\_ab\end{array}\end{equation} having type RR, RL and RL respectively, showing that for this case $\alpha_2\in\{b,c\}$ is necessary for these IRR to be extendable to length 3. Doing so also needs the addition of an extra arbitrary symbol say $\alpha_3$ on the left (because the pointer is at the left in the LHS's of \eqref{eq5}) and using the backward search algorithm to determine for which values of $\alpha_3$ the LHS is reachable. This gives a result which amounts to using the reverse rule
\begin{equation}\label{revrule}2\alpha_3\un{d}\alpha_2\left\{\begin{array}{l}\stackrel{\alpha_3=b}{\leftarrow}\left\{\begin{array}{l}1\un{d}d\alpha_2\\1\un{e}d\alpha_2\end{array}\right.\\\stackrel{\alpha_2=a}{\leftarrow}3\alpha_3 d\un{c}\\
\stackrel{\alpha_2=d}{\leftarrow}1\alpha_3 d\un{a}\\\stackrel{\alpha_2=e}{\leftarrow}5\alpha_3 d\un{a}\end{array}\right.
.\end{equation}
The above restriction on $\alpha_2$ eliminates the bottom 3 branches, so for an origin to exist needs $\alpha_3=b$.
So this gives the following results for the corresponding IRR(3)\begin{equation}\left.\begin{array}{l}1\un{d}d\alpha_2\\1\un{e}d\alpha_2\end{array}\right\}\to1ba\un{\alpha_2} \left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to} 4\_cbd\\\stackrel{\alpha_2=c}{\to}4\_cab\end{array}\right..\end{equation} (Note that in all the calculations that follow, the IRR will be indicated by 3 parts namely the origin, LHS and RHS, which for reasons of compatibility with later terminology will be called respectively $A$, $B$ and $C$ and the the IRR is $A\to B\to C$.)


This procedure was repeated starting from each origin in \eqref{rev2} and gives the following set reverse rules. 
\begin{equation}1\alpha_3\un{d}e\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}2\un{d}de\\
\stackrel{\alpha_3=c}{\leftarrow}2\un{a}de\\
\stackrel{\alpha_3=d}{\leftarrow}2\un{c}de\\\end{array}\right.
\end{equation}

\begin{equation}1\alpha_3\un{e}e\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}2\un{d}ee\\
\stackrel{\alpha_3=c}{\leftarrow}2\un{a}ee\\
\stackrel{\alpha_3=d}{\leftarrow}2\un{c}ee\\\end{array}\right.
\end{equation}

\begin{equation}1\alpha_2\un{a}\alpha_3\leftarrow\left\{\begin{array}{l}
\stackrel{\alpha_2=a}{\leftarrow}2\un{d}a\alpha_3\\
\stackrel{\alpha_2=c}{\leftarrow}2\un{a}a\alpha_3\\
\stackrel{\alpha_2=d}{\leftarrow}2\un{c}a\alpha_3\end{array}\right.
\text{ for }\alpha_2\in\{a,c,d\}\end{equation}

\begin{equation}1c\un{b}\alpha_3\leftarrow 2\un{a}b\alpha_3\end{equation}
\begin{equation}1e\un{c}\alpha_3\leftarrow\emptyset\end{equation}

\begin{equation}\label{exrr}2\alpha_3\un{a}c\stackrel{\alpha_3=b}{\leftarrow}\left\{\begin{array}{l}1\un{d}ac\\1\un{e}ac\end{array}\right.\end{equation} 
\begin{equation}\label{revr14}2\alpha_3\un{c}\alpha_2\left\{\begin{array}{l}\stackrel{\alpha_3=b}{\leftarrow}\left\{\begin{array}{l}1\un{d}c\alpha_2\\1\un{e}c\alpha_2\end{array}\right.\\\stackrel{\alpha_2=a}{\leftarrow}3\alpha_3 c\un{c}\end{array}\right.\text{ for }\alpha_2\in\{a,b,c\}\end{equation}

\begin{equation}\label{revrulesumm}2\alpha_3\un{d}\alpha_2\left\{\begin{array}{l}\stackrel{\alpha_3=b}{\leftarrow}\left\{\begin{array}{l}1\un{d}d\alpha_2\\1\un{e}d\alpha_2\end{array}\right.\\
\stackrel{\alpha_2=a}{\leftarrow}3\alpha_3d\un{c}\\
\end{array}\right.\text{ for }\alpha_2\in\{a,b,c\}
.\end{equation}

\begin{equation}2\alpha_2\un{b}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}3\alpha_2b\un{c}\\
\stackrel{\alpha_3=d}{\leftarrow}1\alpha_2b\un{a}\\
\stackrel{\alpha_3=e}{\leftarrow}5\alpha_2b\un{a}\end{array}\right.\text{ for }\alpha_2\in\{b,c,e\}
\end{equation}

\begin{equation}2a\un{e}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}3ae\un{c}\\
\stackrel{\alpha_3=d}{\leftarrow}1ae\un{a}\\
\stackrel{\alpha_3=e}{\leftarrow}5ea\un{a}\\\end{array}\right.
\end{equation}

\begin{equation}3\alpha_3\un{a}a\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}aa\\5\un{e}aa\end{array}\right.\\
\stackrel{\alpha_3=b}{\leftarrow}3\un{e}aa\\
\stackrel{\alpha_3=c}{\leftarrow}4\un{c}aa\end{array}\right.
\end{equation}

\begin{equation}3\alpha_3\un{e}\alpha_2\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}e\alpha_2\\5\un{e}e\alpha_2\end{array}\right.\\
\stackrel{\alpha_3=b}{\leftarrow}3\un{e}e\alpha_2\\
\stackrel{\alpha_3=c}{\leftarrow}4\un{c}e\alpha_2\end{array}\right.\text{ for }\alpha_2\in\{c,d\}
\end{equation}


\begin{equation}3\alpha_2\un{b}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}1\alpha_2b\un{c}\\
\stackrel{\alpha_3=b}{\leftarrow}4\alpha_2b\un{a}\\
\stackrel{\alpha_3=c}{\leftarrow}2\alpha_2b\un{e}\\
\stackrel{\alpha_3=e}{\leftarrow}5\alpha_2b\un{b}\end{array}\right.\text{ for }\alpha_2\in\{b,c,e\}
\end{equation}



\begin{equation}\label{eq21}3\alpha_2\un{c}\alpha_3\leftarrow\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}1\alpha_2c\un{c}\\
\stackrel{\alpha_3=b}{\leftarrow}4\alpha_2c\un{a}\\
\stackrel{\alpha_3=c}{\leftarrow}2\alpha_2c\un{e}\\
\stackrel{\alpha_3=e}{\leftarrow}5\alpha_2c\un{b}\\
\stackrel{\alpha_2=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}c\alpha_3\\5\un{e}c\alpha_3\end{array}\right.\\
\stackrel{\alpha_2=c}{\leftarrow}4\un{c}c\alpha_3\\
\end{array}\right.\text{ for }\alpha_2\in\{a,c,d\}
\end{equation}


\begin{equation}3\alpha_2\un{d}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}1\alpha_2d\un{c}\\
\stackrel{\alpha_3=b}{\leftarrow}4\alpha_2d\un{a}\\
\stackrel{\alpha_3=c}{\leftarrow}2\alpha_2d\un{e}\\
\stackrel{\alpha_3=e}{\leftarrow}5\alpha_2d\un{b}\\
\end{array}\right.\text{ for }\alpha_2\in\{d,e\}
\end{equation}

\begin{equation}4\alpha_3\un{b}\alpha_2\left\{\begin{array}{l}
\stackrel{\alpha_3=b}{\leftarrow}4\un{b}b\alpha_2\\
\stackrel{\alpha_3=c}{\leftarrow}3\un{a}b\alpha_2\end{array}\right.\text{ for }\alpha_2\in\{a,d\}
\end{equation}
\begin{equation}4\alpha_3\un{e}d\left\{\begin{array}{l}
\stackrel{\alpha_3=b}{\leftarrow}4\un{b}ed\\
\stackrel{\alpha_3=c}{\leftarrow}3\un{a}ed\\\end{array}\right.
\end{equation}
\begin{equation}4a\un{a}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}5aa\un{d}\\
\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}2aa\un{b}\\3aa\un{b}\end{array}\right.\\
\stackrel{\alpha_3=d}{\leftarrow}1aa\un{b}\\\end{array}\right.
\end{equation}

\begin{equation}4e\un{a}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}5ea\un{d}\\
\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}2ea\un{b}\\3ea\un{b}\end{array}\right.\\
\stackrel{\alpha_3=d}{\leftarrow}1ea\un{b}\\\end{array}\right.
\end{equation}





\begin{equation}4\alpha_2\un{d}\alpha_3\left\{\begin{array}{l}
\stackrel{\alpha_3=a}{\leftarrow}5\alpha_2d\un{d}\\
\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}2\alpha_2d\un{b}\\3\alpha_2d\un{b}\end{array}\right.\\
\stackrel{\alpha_3=d}{\leftarrow}1\alpha_2d\un{b}\\
\stackrel{\alpha_2=c}{\leftarrow}3\un{a}d\alpha_3\\
\end{array}\right.\text{ for }\alpha_2\in\{c,e\}
\end{equation}
\begin{equation}5\alpha_3\un{c}b\stackrel{\alpha_3=a}{\leftarrow}4\un{e}cb\end{equation}
\begin{equation}5\alpha_3\un{c}d\stackrel{\alpha_3=a}{\leftarrow}4\un{e}cd\end{equation}
\begin{equation}5\alpha_3\un{e}b\stackrel{\alpha_3=a}{\leftarrow}4\un{e}eb\end{equation}
\begin{equation}5\alpha_3\un{e}d\stackrel{\alpha_3=a}{\leftarrow}4\un{e}ed\end{equation}
\begin{equation}5\alpha_2\un{a}\alpha_3\left\{\begin{array}{l}\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}3\alpha_2a\un{d}\\4\alpha_2a\un{d}\end{array}\right.\\
\stackrel{\alpha_2=a}{\leftarrow}4\un{e}a\alpha_3
\end{array}\right.\text{ for }\alpha_2\in\{a,c,d\}
\end{equation}
\begin{equation}5a\un{b}\alpha_3\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}3ab\un{d}\\4ab\un{d}\end{array}\right.
\end{equation}
\begin{equation}5e\un{b}\alpha_3\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}3eb\un{d}\\4eb\un{d}\end{array}\right.\end{equation}
\begin{equation}5\alpha_2\un{d}\alpha_3\stackrel{\alpha_3=c}{\leftarrow}\left\{\begin{array}{l}3\alpha_2d\un{d}\\4\alpha_2d\un{d}\end{array}\right.\text{ for }\alpha_2\in\{c,e\}\end{equation}

The following is the set of IRR(3) derived.
\begin{equation}\label{irr3.36}\left.\begin{array}{l}1\un{d}db\\1\un{e}db\end{array}\right\}\to 1ba\un{b}\to 4\_cbd\end{equation}
\begin{equation}\label{irr3.37}\left.\begin{array}{l}1\un{d}ac\\1\un{e}ac\end{array}\right\}\to1bc\un{c}\to4\_caa\end{equation}

\begin{equation}\label{irr3.38}\left.\begin{array}{l}1\un{d}c\alpha_2\\1\un{e}c\alpha_2\end{array}\right\}\to1bd\un{\alpha_2}\left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to}3\_ecd\\\stackrel{\alpha_2=c}{\to}3\_eca\end{array}\right.\end{equation}

\begin{equation}\label{irr3.39}\left.\begin{array}{l}1\un{d}dc\\1\un{e}dc\end{array}\right\}\to 1ba\un{c}\to 4\_cab\end{equation}
\begin{equation}\label{irr3.40}1\alpha_2c\un{c}\left\{\begin{array}{l}\stackrel{\alpha_2=a}{\to} 2\un{a}aa\to1dbc\_\\
\stackrel{\alpha_2=c}{\to} 2\un{c}aa\to1abc\_\\\stackrel{\alpha_2=d}{\to} 2\un{d}aa\to1cbc\_\\\end{array}\right.
\end{equation}

\begin{equation}\label{irr3.41}4\alpha_2c\un{a}\left\{\begin{array}{l}\stackrel{\alpha_2=a}{\to}2\un{a}ab\to 3dbc\_\\
\stackrel{\alpha_2=c}{\to} 2\un{c}ab\to3abc\_\\\stackrel{\alpha_2=d}{\to}2\un{d}ab\to 3cbc\_\\\end{array}\right.
\end{equation}

\begin{equation}\label{irr3.42}2\alpha_2c\un{e}\left\{\begin{array}{l}\stackrel{\alpha_2=a}{\to} 2\un{a}ac\to1dbd\_\\
\stackrel{\alpha_2=c}{\to}2\un{c}ac\to 1abd\_\\\stackrel{\alpha_2=d}{\to} 2\un{d}ac\to1cbd\_\\\end{array}\right.
\end{equation}
\begin{equation}\label{irr3.43}5\alpha_2c\un{b}\left\{\begin{array}{l}\stackrel{\alpha_2=a}{\to} 2\un{a}ae\to5\_ccc\\
\stackrel{\alpha_2=c}{\to}2\un{c}ae\to 3\_bcc\\\stackrel{\alpha_2=d}{\to}2\un{d}ae\to 1abd\_\\\end{array}\right.
\end{equation}


\begin{equation}\label{irr3.44}\left.\begin{array}{l}3\alpha_2a\un{d}\\4\alpha_2a\un{d}\end{array}\right\}\to2\un{\alpha_2}ec\left\{\begin{array}{l}
\stackrel{\alpha_2=a}{\to}1cbd\_\\
\stackrel{\alpha_2=c}{\to}1dbd\_\\
\stackrel{\alpha_2=d}{\to}1abd\_\\\end{array}\right.
\end{equation}

\begin{equation}\label{irr3.45_1}2\un{d}\left\{\begin{array}{l}d\\e\end{array}\right\}e\to2ab\un{e}\to3\_bcc
\end{equation}
\begin{equation}\label{irr3.45_2}2\un{a}\left\{\begin{array}{l}d\\e\end{array}\right\}e\to2cb\un{e}\to1abd\_
\end{equation}
\begin{equation}\label{irr3.45_3}2\un{c}\left\{\begin{array}{l}d\\e\end{array}\right\}e\to2db\un{e}\to5\_ccc\end{equation}

\begin{equation}\label{irr3.46_1}5aa\un{d}\to3\un{a}ba\to3abc\_
\end{equation}
\begin{equation}\label{irr3.46_2}\left.\begin{array}{l}2aa\un{b}\\3aa\un{b}\end{array}\right\}\to3\un{a}bc\to3cbc\_
\end{equation}
\begin{equation}\label{irr3.46_3}1aa\un{b}\to3\un{a}bd\to2\_aec
\end{equation}

\begin{equation}\label{irr3.47_1}
5ea\un{d}\to3\un{e}ba\to4bcc\_
\end{equation}
\begin{equation}\label{irr3.47_2}
\left.\begin{array}{l}2ea\un{b}\\3ea\un{b}\end{array}\right\}\to3\un{e}bc\to2bab\_
\end{equation}
\begin{equation}\label{irr3.47_3}
1ea\un{b}\to3\un{e}bd\to2bdb\_
\end{equation}

\begin{equation}\label{irr3.48}\begin{array}{l}
3ae\un{c}\to3\un{a}ca\to4ccc\_\\
1ae\un{a}\to3\un{a}cd\to2cdb\_\\
5ae\un{a}\to3\un{a}ce\to3ccb\_\end{array}
\end{equation}

\begin{equation}\label{irr3.49}\left.\begin{array}{l}3ab\un{d}\\4ab\un{d}\end{array}\right\}\to3\un{a}ec\to3caa\_\end{equation}

\begin{equation}\label{irr3.50}\left.\begin{array}{l}3eb\un{d}\\4eb\un{d}\end{array}\right\}\to3\un{e}ec\to4bcc\_\end{equation}

\begin{equation}\label{irr3.51}\left.\begin{array}{l}4\un{e}cb\\4\un{e}eb\end{array}\right\}\to3aa\un{b}\to3cbc\_\end{equation}

\begin{equation}\label{irr3.52_1}
\left.\begin{array}{l}5\un{c}ec\\5\un{e}ec\end{array}\right\}\to3ab\un{c}\to3\_bca\\
\end{equation}
\begin{equation}\label{irr3.52_2}
3\un{e}ec\to3bb\un{c}\to4bcc\_
\end{equation}
\begin{equation}\label{irr3.52_3}
4\un{c}ec\to3cb\un{c}\to1abc\_
\end{equation}

\begin{equation}\label{irr3.53}\left.\begin{array}{l}4\un{e}cd\\4\un{e}ed\end{array}\right\}\to3aa\un{d}\to1cbd\_\end{equation}
\begin{equation}\label{irr3.54_1}
\left.\begin{array}{l}5\un{c}ed\\5\un{e}ed\end{array}\right\}\to3ab\un{d}\to3caa\_
\end{equation}
\begin{equation}\label{irr3.54_2}\begin{array}{l}
3\un{e}ed\to3bb\un{d}\to4\_cec\\
4\un{c}ed\to3cb\un{d}\to2\_aec\end{array}
\end{equation}

\begin{equation}\label{irr3.55_1}
\left.\begin{array}{l}3\alpha_2b\un{c}\\1\alpha_2b\un{c}\end{array}\right\}\to4\un{\alpha_2}ca
\left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to}4bcc\_\\
\stackrel{\alpha_2=c}{\to}1abc\_\\
\stackrel{\alpha_2=e}{\to}4aac\_\end{array}\right.\\
\end{equation}
\begin{equation}\label{irr3.55_2}
4\alpha_2b\un{a}\to4\un{\alpha_2}cb
\left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to}2bab\_\\
\stackrel{\alpha_2=c}{\to}3abc\_\\
\stackrel{\alpha_2=e}{\to}3cbc\_\end{array}\right.\\
\end{equation}
\begin{equation}\label{irr3.55_3}
2\alpha_2b\un{e}\to4\un{\alpha_2}cc
\left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to}2bab\_\\
\stackrel{\alpha_2=c}{\to}1abd\_\\
\stackrel{\alpha_2=e}{\to}2adb\_\end{array}\right.\\
\end{equation}
\begin{equation}\label{irr3.55_4}
1\alpha_2b\un{a}\to4\un{\alpha_2}cd
\left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to}2bdb\_\\
\stackrel{\alpha_2=c}{\to}1aba\_\\
\stackrel{\alpha_2=e}{\to}1cbd\_\end{array}\right.\\
\end{equation}
\begin{equation}\label{irr3.55_5}
\left.\begin{array}{l}5\alpha_2b\un{a}\\5\alpha_2b\un{b}\end{array}\right\}\to4\un{\alpha_2}ce
\left\{\begin{array}{l}\stackrel{\alpha_2=b}{\to}3bcb\_\\
\stackrel{\alpha_2=c}{\to}3\_bcc\\
\stackrel{\alpha_2=e}{\to}3aab\_\end{array}\right.\\
\end{equation}

\begin{equation}\label{irr3.56_1}
\left.\begin{array}{l}3cd\un{d}\\4cd\un{d}\end{array}\right\}\to4\un{c}ac\to3ccc\_
\end{equation}
\begin{equation}\label{irr3.56_2}
\left.\begin{array}{l}3ed\un{d}\\4ed\un{d}\end{array}\right\}\to4\un{e}ac\to1cbd\_
\end{equation}

\begin{equation}\label{irr3.57}4\un{b}b\alpha_2\to4bb\un{\alpha_2}\left\{\begin{array}{l}
\stackrel{\alpha_2=a}{\to}2bab\_\\
\stackrel{\alpha_2=d}{\to}4\_cec\end{array}\right.\end{equation}
\begin{equation}\label{irr3.58}3\un{a}b\alpha_2\to4cb\un{\alpha_2}\left\{\begin{array}{l}
\stackrel{\alpha_2=a}{\to}3abc\_\\
\stackrel{\alpha_2=d}{\to}2\_aec\end{array}\right.\end{equation}


\begin{equation}\label{irr3.59}\left.\begin{array}{l}5\un{c}aa\\5\un{e}aa\end{array}\right\}\to4ac\un{a}\to3dbc\_\end{equation}
\begin{equation}\label{irr3.60}3\un{e}aa\to4bc\un{a}\to4\_cab\end{equation}
\begin{equation}\label{irr3.61}4\un{c}aa\to4cc\un{a}\to3abc\_\end{equation}


\begin{equation}\label{irr3.62_1}\left.\begin{array}{l}1\alpha_2d\un{c}\\5\alpha_2 d\un{d}\end{array}\right\}\to5\un{\alpha_2}ca\to1dbc\_\text{ for }\alpha_2\in\{c,e\}
\end{equation}
\begin{equation}\label{irr3.62_2}
4\alpha_2d\un{a}\to5\un{\alpha_2}cb\to3dbc\_\text{ for }\alpha_2\in\{c,e\}
\end{equation}
\begin{equation}\label{irr3.62_3}
\left.\begin{array}{l}2\alpha_2d\un{b}\\3\alpha_2d\un{b}\\2\alpha_2 d\un{e}\end{array}\right\}\to5\un{\alpha_2}cc\to1dbd\_\text{ for }\alpha_2\in\{c,e\}
\end{equation}
\begin{equation}\label{irr3.62_4}
1\alpha_2d\un{b}\to5\un{\alpha_2}cd\to1dba\_\text{ for }\alpha_2\in\{c,e\}
\end{equation}
\begin{equation}\label{irr3.62_5}
5\alpha_2d\un{b}\to5\un{\alpha_2}ce\to5\_ccc
\text{ for }\alpha_2\in\{c,e\}
\end{equation}

\begin{equation}\label{irr3.63}\begin{array}{l}
4\un{b}ed\to5ba\un{d}\to4\_cba\\
3\un{a}ed\to5ca\un{d}\to2\_aba\end{array}
\end{equation}
These are in agreement with the 78 IRR(3) found by the computer program \cite{tie}.
The numbers of IRR found for the TM for lengths 2-10 are 55,78,163,291,702,1578,3958,9686, and 24631 respectively.

\section{\label{sec2}A systematic approach to generating the IRR's}
Indicating CS's by just the the pointer positions in typewriter font, any rule of the form $1\to n$ of length n demonstrates the reachability of the CS $n$ regardless of whether or not there is another CS of the form $n$ between the CS's $1$ and $n$. If there is no other $1$ between them, the $1$ is an origin. A preceding CS of the form $1$ would not be recorded as an origin because the backward searching algorithm would stop when the first $1$ searching backwards is reached, and it is unnecessary to do so. This follows from the backward searching algorithm in section 2.2 of \cite{jhn2017}.
Therefore \begin{Lemma}\label{lemma1} A computation represented by $1\to n\to 0$ or $n\to 1\to n+1$ represents a triplet for an extendable IRR (type RL or LR respectively) if and only if the origin indicated is the first one arrived at after tracing the computation back from the LHS i.e there is no other CS $1$ in the first case, and no other CS $n$ in the second case between the $1$ and the $n$.\end{Lemma} 

Generating the IRR starts with all single TM steps in the above notation $1\to 0$ (i.e. $\un{x}\to \_x$) or $1\to 2$ (i.e. 
$\un{x}\to x\_$) where $x$'s represents an arbitrary symbol that could be different for each use. In the first case, adding the arbitrary symbol $\alpha$ on the left and continuing the computation as far as possible gives results either of the form (i) $2\to 1\to 3$ or (ii) $2\to 1\to 0$ i.e. $\alpha\un{x}\to\un{\alpha}x\to xx\_\text{ or }\_xx$ respectively. The results in case (i) are IRR by Lemma~\ref{lemma1} because there can be no other CS's between the $2$ and the $1$. The results from (ii) are IRR's if and only if the first move beyond the $1$ is to $2$ i.e. the computation has the form $2\to 1\to 2 \to 0$. This ensures that the rule $1\to 0$ contained in (ii) of length 2 is irreducible. Likewise for the mirror image case starting with a rule of the form $1\to 2$ adding the $\alpha$ on the right and continuing gives results of the form $1\to 2\to 0$ ($\in \text{IRR}(2)$) or of the form $1\to 2\to 3$ ($\in\text{IRR}(2)$ if and only if the first move from the $2$ is to $1$). 

Continuing from this, let $X$ be a member of IRR($n$). Then $X$ can be represented as $A\to B\to C$ where the pointer swaps ends between $A$ and $B$ to establish the reachability of $B$ necessary for $X$ to be an IRR. There may be more than one such CS $A$ for a single $B$ and the set of all such $A$ will be denoted by $O_1(B)$ (the same as $S(B)$ in \cite{jhn2017}), the 1 referring to the backward searching algorithm that terminates in condition 1. (Likewise if it terminates in condition 2, the set of such endpoints will be denoted as $O_2(B)$, but these do not confer reachability and will not be referred to as origins.) If the pointer is at the right in $A$ and at the left in $B$ then at $C$ it can be at the left or right so that $X$ must be represented as either of the triplet forms $n\to 1\to 0$ or $n\to 1\to n+1$ respectively and having types LL and LR respectively. Likewise if the pointer is at the left in $A$ (the mirror image forms), $X$ must be represented by either of $1\to n\to n+1$ or $1\to n\to 0$, having types RR and RL respectively.

Either the backward search from $A$ or the forward computation from $C$ (or both) may lead to a CS that has arisen before. These are stationary cycling cases. If it happens in the backward search, the effect is the same as when condition 3 occurs i.e. when no further backward steps are possible and this branch of the search ends with no new origins. In the forward computation from $C$ this prevents a genuine RHS to be found. The IRR is then of type $LC$ or $RC$. No new IRR's can be derived from these cases.

In order to generate all the IRR $Y$ of length n+1 based on the single IRR $X$ of length n and having the form $n\to 1\to n+1$, consider first $A\alpha\to B\alpha\to C\alpha$ where $\alpha$ is any symbol the TM uses. Clearly by Theorem 9.1 of \cite{jhn2013} every such IRR $Y$ can be obtained starting from the LHS $B\alpha$ if an appropriate $\alpha$ can be found. The symbol $\alpha$ must be chosen so that $B\alpha$ is reachable and the origins $O_1(B\alpha)\ne\emptyset$ for it need to be found. These are all the terminal CS's of length $n+1$ from the backward searching algorithm starting from $B\alpha$ and ending in condition (1). Each of these branches has a point where the pointer first reaches $n$ and this set of CS's is $A\alpha$ because the $\alpha$ has yet played no part, so $O_1(B\alpha)$ is the union of the backward searches $O_1$ applied to all the CS's in $A\alpha$, thus the backward search algorithm is applied to $A\alpha$ and identifying all possible values of $\alpha$ i.e. the values of $\alpha$ for which $O_1(A\alpha)\ne\emptyset$ and generating all its origins for each such $\alpha$. Also the forward computation from $C\alpha$ is continued as far as possible to generate the RHS of $Y$ and hence what its type is (RR, RL, LR, LL, RC, or LC) the last two cases coming from a stationary cycle in the forward computation from $C\alpha$. If the pointer is at the left in $A$ and $C$ and the right in $B$ (the mirror image case) the added arbitrary symbol $\alpha$ will be on the left. This procedure for generating the all the IRR $Y$ of length $n+1$ like this from an IRR $X$ of length $n$, including the mirror image case where the triplet form of $X$ is $1\to n\to 0$, will denoted by the function $F$. This proves that
\begin{Theorem}\label{irr_ind_thm} Every member of IRR($n+1$) can be obtained using $F$ from some $X\in\text{IRR}(n)$. Also, because an IRR is uniquely determined by is LHS, the sets of IRR obtained like this for different $X$ (different $B$) must be disjoint i.e. $F^{-1}$ applied to a member of IRR($n+1$) is a unique member of IRR($n$). The first part can be written symbolically as
\begin{equation}\label{irr_ind}\text{IRR}(n+1)=\bigcup _{X\in IRR(n)}\{ F(X)\}\end{equation}
\end{Theorem}

To illustrate this, the following is an outline showing an IRR of length n of type RLR (type LR with origin having the pointer at the right) as above and the possible types of result (except the cases where a stationary cycle occurs) of this argument for a given symbol $\alpha$ that could include a new IRR triplet of length $n+1$.
\begin{equation}\label{irr_deriv1}
\left.\begin{array}{ccc}\left.\begin{array}{c}\text{Cannot be used to}\\\text{ prove reachability }\end{array}\right\}&1&\to\\\text{Does prove reachability}&n+1&\to\end{array}\right\}n\to 1\to n+1\left\{\begin{array}{ccc}\to &0&\text{type LL}\\\to &n+2&\text{type LR}\end{array}\right.
\end{equation}
The 3 central CS's refer to a member of IRR($n$), and the leftmost, central, and rightmost CS's refer to the corresponding member of IRR($n+1$) if reachability of the CS $1$ is found. The corresponding mirror image result for the LRL case is as follows:
\begin{equation}\label{irr_deriv2}
\left.\begin{array}{ccc}\text{Does prove reachability}&1&\to\\\left.\begin{array}{c}\text{Cannot be used to}\\\text{ prove reachability }\end{array}\right\}&n+1&\to\end{array}\right\}2\to n+1\to 1\left\{\begin{array}{ccc}\to &0&\text{type RL}\\\to &n+2&\text{type RR}\end{array}\right.
\end{equation}
In this case note that because the $\alpha$ is added on the left, all the pointer positions in the IRR of length $n$ have been increased by 1 when they appear in the embedded IRR of length $n$, so originally they would be $1\to n\to 0$.

The above procedure allows the generation of all the IRR of a TM up to any given length and has been implemented \cite{tie}. In the remainder of this paper, this procedure will be adapted to the incomplete description of IRR's (IRR outlines with $\ldots$) needed to make the analysis manageable for the example TM, that is expected to have an infinite number of IRR's.




\section{Using abbreviated IRR's}
Abbreviated IRR's have been found to be very useful because they result in shortening of the lists of cases to be considered, and sets of IRR's that match the abbreviated IRR's often have similar derivations of new IRR's one symbol longer, which can be dealt with together. The latter is because in \eqref{irr_deriv1} the derivation involves two derivations one of each of the forms $n+1\to n$ and $n+1\to n+2$ and it is to be expected that these will often involve one or a small number of TM steps. A similar remark applies for the case \eqref{irr_deriv2} too. Also the treatment of IRR's in TM1 in \cite{jhn2017} where sets conforming to the patterns or outline IRR's could be treated in the same way, allowed a proof of a general method for obtaining all the IRR($n+1$) from the IRR($n$) for all sufficiently large $n$ for this TM.

The abbreviations done here are (1) to a fixed length $k$ of the strings of symbols, where the symbol at the pointer in the origin is at one end and (2) the LHS is removed completely. The abbreviation is indicated by $\ldots$ in place of the deleted symbols in the origin and the RHS. This presentation has the property that the pointer position appears in the RHS column if and only if the IRR is of extendable type i.e. type RL or LR. Table~\ref{ind1} was obtained by abbreviating all the IRR(3) to length $k=2$. For this purpose, IRR's with many origins have a separate entry for each origin. This allows the origins to be unique for each row in the tables.
\begin{longtable}{ll|ll}
\caption{List of patterns for the IRR(3)\label{ind1}}\\
Origin&RHS's&Origin&RHS's\\\hline
$1\un{d}d\ldots$&$4\_cb\ldots$&$5\un{e}e\ldots$&$\{3\_bc\ldots,3ca\ldots\}$\\
$1\un{e}d\ldots$&$4\_cb\ldots$&$3\un{e}e\ldots$&$\{4bc\ldots,4\_ce\ldots\}$\\
$1\un{d}d\ldots$&$4\_ca\ldots$&$4\un{e}c\ldots$&$\{3cb\ldots,1cb\ldots\}$\\
$1\un{e}d\ldots$&$4\_ca\ldots$&$4\un{e}e\ldots$&$\{3cb\ldots,1cb\ldots\}$\\
$1\un{d}a\ldots$&$4\_ca\ldots$&$4\un{c}e\ldots$&$\{1ab\ldots,2\_ae\ldots\}$\\
$1\un{e}a\ldots$&$4\_ca\ldots$&$3\ldots b\un{c}$&$\{4\ldots cc\_,1\ldots bc\_,4\ldots ac\_\}$\\
$1\un{d}c\ldots$&$3\_ec\ldots$&$1\ldots b\un{c}$&$\{4\ldots cc\_,1\ldots bc\_,4\ldots ac\_\}$\\
$1\un{e}c\ldots$&$3\_ec\ldots$&$4\ldots b\un{a}$&$\{2\ldots ab\_,3\ldots bc\_\}$\\
$1\ldots c\un{c}$&$1\ldots bc\_$&$2\ldots b\un{e}$&$\{2\ldots ab\_,1\ldots bd\_,2\ldots db\_\}$\\
$4\ldots c\un{a}$&$3\ldots bc\_$&$1\ldots b\un{a}$&$\{2\ldots db\_,1\ldots ba\_,1\ldots bd\_\}$\\
$2\ldots c\un{e}$&$1\ldots bd\_$&$5\ldots b\un{a}$&$\{3\ldots cb\_,3\ldots cc,3\ldots ab\_\}$\\
$5\ldots c\un{b}$&$\{5\ldots cc,3\ldots cc,1\ldots bd\_\}$&$5\ldots b\un{b}$&$\{3\ldots cb\_,3\ldots cc,3\ldots ab\_\}$\\
$3\ldots a\un{d}$&$1\ldots bd\_$&$4\un{b}b\ldots$&$\{2ba\ldots,4\_ce\ldots\}$\\
$4\ldots a\un{d}$&$1\ldots bd\_$&$3\un{a}b\ldots$&$\{3ab\ldots,2\_ae\ldots\}$\\
$2\un{d}d\ldots$&$3\_bc\ldots$&$5\un{c}a\ldots$&$3db\ldots$\\
$2\un{d}e\ldots$&$3\_bc\ldots$&$5\un{e}a\ldots$&$3db\ldots$\\
$2\un{a}d\ldots$&$1ab\ldots$&$3\un{e}a\ldots$&$4\_ca\ldots $\\
$2\un{a}e\ldots$&$1ab\ldots$&$4\un{c}a\ldots$&$3ab\ldots$\\
$2\un{c}d\ldots$&$5\_cc\ldots$&$1\ldots d\un{c}$&$1\ldots bc\_$\\
$2\un{c}e\ldots$&$5\_cc\ldots$&$4\ldots d\un{a}$&$3\ldots bc\_$\\
$5\ldots a\un{d}$&$\{3\ldots bc\_,4\ldots cc\_\}$&$2\ldots d\un{e}$&$1\ldots bd\_$\\
$2\ldots a\un{b}$&$\{3\ldots bc\_,2\ldots ab\_\}$&$5\ldots d\un{b}$&$5\ldots cc$\\
$3\ldots a\un{b}$&$\{3\ldots bc\_,2\ldots ab\_\}$&$5\ldots d\un{d}$&$1\ldots bc\_$\\
$1\ldots a\un{b}$&$\{2\ldots ec,2\ldots db\_\}$&$2\ldots d\un{b}$&$1\ldots bd\_$\\
$3\ldots e\un{c}$&$4\ldots cc\_$&$3\ldots d\un{b}$&$1\ldots bd\_$\\
$1\ldots e\un{a}$&$2\ldots db\_$&$1\ldots d\un{b}$&$1\ldots ba\_$\\
$5\ldots e\un{a}$&$3\ldots cb\_$&$4\un{b}e\ldots$&$4\_cb\ldots$\\
$3\ldots b\un{d}$&$\{3\ldots aa\_,4\ldots cc\_\}$&$3\un{a}e\ldots$&$2\_ab\ldots$\\
$4\ldots b\un{d}$&$\{3\ldots aa\_,4\ldots cc\_\}$&$3\ldots d\un{d}$&$\{3\ldots cc\_,1\ldots bd\_\}$\\
$5\un{c}e\ldots$&$\{3\_bc\ldots,3ca\ldots\}$&$4\ldots d\un{d}$&$\{3\ldots cc\_,1\ldots bd\_\}$\\
\end{longtable}


Treating Table~\ref{ind1} at first as a hypothesis to be proved by induction for IRR of length $n\ge 3$ where $\ldots$ represents any string of symbols of length $\ge 1$ that could be different whenever it is used, suggests (1) following the method in Section~\ref{sec2} to each of the patterns provided they are extendable i.e. of type LR or RL in Table~\ref{ind1}, and then (2) truncating the result to two symbols from the pointer at the new origin so generating another result of the same form as those already in Table~\ref{ind1}. This must repeated as necessary to ensure closure, i.e. every outline IRR$(n+1)$ must also appear as an outline IRR($n$) resulting in Table~\ref{irr_2r}. Thus an infinite number of IRR could be captured by the resulting recursive description. 
This procedure was done in order that every application of $F$ (that always maps IRR's to IRR's and by repeated application generates all IRR's for a TM from the set IRR(3)) maps an IRR outline in Table~\ref{irr_2r} to another IRR outline in Table~\ref{irr_2r} unless the backward search procedure to find new origins goes in the unexpected direction. The analysis for these cases where the derivation of the new origin takes the pointer away from the $\alpha$ will be taken as far a possible consistent with the constraints of the other calculations and are therefore represented differently i.e. the new origin is given with the pointer opposite the $\alpha$ and not truncated to $k=2$ symbols (they have $k=3$), and $\alpha$ can take any of the 5 values. This issue is taken up again in Section~\ref{sec4}. 

For example starting from the fifth result in Table~\ref{ind1}
\begin{equation}\label{addalpha1}1\un{d}a\ldots\to\to4\_ca\ldots\end{equation} (using \eqref{rev1}.2) this gives

\begin{equation}\label{addalpha2}\begin{tabular}{lccc}deriving the origin&&RHS&$\alpha$\\
$\alpha A$&$\alpha C$&&\\
$1\alpha\un{d}a\ldots\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}2\un{d}da\ldots\\
\stackrel{\alpha=c}{\leftarrow}2\un{a}da\ldots\\
\stackrel{\alpha=d}{\leftarrow}2\un{c}da\ldots\\
\end{array}\right.$&
$\begin{array}{l}4\un{a}ca\ldots\\4\un{c}ca\ldots\\4\un{d}ca\ldots\\\end{array}$&
$\begin{array}{l}3\_bca\ldots\\1abc\_\ldots\\5\_cca\ldots\end{array}$&$\begin{array}{l}a\\c\\d\end{array}$
\end{tabular}\end{equation}
which is truncated to
\begin{equation}\label{addalpha3}\begin{array}{l}2\un{d}d\ldots\to\to 3\_bc\ldots\\
2\un{a}d\ldots\to\to1ab\ldots\\
2\un{c}d\ldots\to\to 5\_cc\ldots\end{array}\end{equation} for $\alpha= a,c,d$ respectively. Note that in this argument, adding the arbitrary symbol $\alpha$ on the left (because the pointer in the origin is on the left) maintains the pointer being on the right hand end of the string of symbols in the LHS (not shown), and this is necessary to obtain an abbreviated IRR.
The result of this argument is that if an IRR of length $n$ conforms to \eqref{addalpha1}, then there are 3 more IRR's of length $n+1$ corresponding to \eqref{addalpha3} for $\alpha\in\{a,c,d\}$ respectively.
The second of these results in \eqref{addalpha3} has the pointer in the RHS on the right (not shown due to truncation), so this IRR has type RR and cannot be used to derive other IRR.

These are examples of rules that generate IRR's of length $n+1$ from other IRR's of length $n$ and are expressed (for the case where the unknown symbols are on the right) in Table~\ref{irr_2r}  for $k=2$. Collectively such rules will be referred to as IRR-generating rules (IGR) to distinguish them from computation rules.

 The longest possible tape length to derive a triplet of the form $n\to 1\to n+1$ in the notation of \eqref{irr_deriv1} from one of the form $n-1\to 1\to n$ would involve the pointer moving in the backward search thus: $n-1 \leftarrow 2\leftarrow n$ and would in general be $n-1\leftarrow n-k\leftarrow n$. It could not reach point $1$ because that would terminate the backward search algorithm. Therefore $2\le k\le n-2$. It is interesting to note that the backward search in general takes the form of an IRR triplet of length $k-1$ run in reverse.





\fontsize{10}{10}\selectfont
\begin{longtable}{c|l@{\hspace{0.5em}}l|c|l@{\hspace{0.5em}}l}
\caption{Outline IRRs of length $n$ and their derived outline IRR of length $n+1$, with the unknown symbols on the right.\label{irr_2r}}\\
set&\multicolumn{2}{c|}{IRR($n$)}&$\alpha$&\multicolumn{2}{c}{IRR($n+1$)}\\
number&Origin&RHS&&Origin&RHS\\
\hline
$1$&$1\un{d}a\ldots$&$4\_ca\ldots$&$a$&$2\un{d}d\ldots$&$3\_bc\ldots$\\
&&&$c$&$2\un{a}d\ldots$&$1ab\ldots$\\
&&&$d$&$2\un{c}d\ldots$&$5\_cc\ldots$\\\hline  
$2$&$1\un{d}c\ldots$&$3\_ec\ldots$&$a$&$2\un{d}d\ldots$&$3ca\ldots$\\
&&&$c$&$2\un{a}d\ldots$&$2\_ae\ldots$\\
&&&$d$&$2\un{c}d\ldots$&$5\_ce\ldots$\\\hline
$3$&$1\un{d}d\ldots$&$4\_ca\ldots$&$a$&$2\un{d}d\ldots$&$3\_bc\ldots$\\
&&&$c$&$2\un{a}d\ldots$&$1ab\ldots$\\
&&&$d$&$2\un{c}d\ldots$&$5\_cc\ldots$\\\hline
$4$&$1\un{d}d\ldots$&$4\_cb\ldots$&$a$&$2\un{d}d\ldots$&$3\_bc\ldots$\\
&&&$c$&$2\un{a}d\ldots$&$3ab\ldots$\\
&&&$d$&$2\un{c}d\ldots$&$5\_cc\ldots$\\\hline
$5$&$1\un{e}a\ldots$&$4\_ca\ldots$&$a$&$2\un{d}e\ldots$&$3\_bc\ldots$\\
&&&$c$&$2\un{a}e\ldots$&$1ab\ldots$\\
&&&$d$&$2\un{c}e\ldots$&$5\_cc\ldots$\\\hline
$6$&$1\un{e}c\ldots$&$3\_ec\ldots$&$a$&$2\un{d}e\ldots$&$3ca\ldots$\\
&&&$c$&$2\un{a}e\ldots$&$2\_ae\ldots$\\
&&&$d$&$2\un{c}e\ldots$&$5\_ce\ldots$\\\hline
$7$&$1\un{e}d\ldots$&$4\_ca\ldots$&$a$&$2\un{d}e\ldots$&$3\_bc\ldots$\\
&&&$c$&$2\un{a}e\ldots$&$1ab\ldots$\\
&&&$d$&$2\un{c}e\ldots$&$5\_cc\ldots$\\\hline
$8$&$1\un{e}d\ldots$&$4\_cb\ldots$&$a$&$2\un{d}e\ldots$&$3\_bc\ldots$\\
&&&$c$&$2\un{a}e\ldots$&$3ab\ldots$\\
&&&$d$&$2\un{c}e\ldots$&$5\_cc\ldots$\\\hline
$9$&$2\un{a}d\ldots$&$2\_ae\ldots$&$b$&$1\un{d}a\ldots$&$4\_ca\ldots$\\
&&&$b$&$1\un{e}a\ldots$&$4\_ca\ldots$\\
&&&$\alpha$&$1\alpha a\un{a}\ldots$&$RHS$\\ \hline
$10$&$2\un{a}d\ldots$&$1ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$11$&$2\un{a}d\ldots$&$3ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$12$&$2\un{a}e\ldots$&$2\_ae\ldots$&$b$&$1\un{d}a\ldots$&$4\_ca\ldots$\\
&&&$b$&$1\un{e}a\ldots$&$4\_ca\ldots$\\
&&&$\alpha$&$5\alpha a \un{a}\ldots$&$RHS$\\\hline
$13$&$2\un{a}e\ldots$&$1ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$14$&$2\un{a}e\ldots$&$3ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$15$&$2\un{c}d\ldots$&$5\_cc\ldots$&$b$&$1\un{d}c\ldots$&$3\_ec\ldots$\\
&&&$b$&$1\un{e}c\ldots$&$3\_ec\ldots$\\
&&&$\alpha$&$1\alpha c\un{a}\ldots$&$RHS$\\\hline
$16$&$2\un{c}d\ldots$&$5\_ce\ldots$&$b$&$1\un{d}c\ldots$&$3\_ec\ldots$\\
&&&$b$&$1\un{e}c\ldots$&$3\_ec\ldots$\\
&&&$\alpha$&$1\alpha c\un{a}\ldots$&$RHS$\\\hline
$17$&$2\un{c}e\ldots$&$5\_cc\ldots$&$b$&$1\un{d}c\ldots$&$3\_ec\ldots$\\
&&&$b$&$1\un{e}c\ldots$&$3\_ec\ldots$\\
&&&$\alpha$&$5\alpha c\un{a}\ldots$&$RHS$\\\hline
$18$&$2\un{c}e\ldots$&$5\_ce\ldots$&$b$&$1\un{d}c\ldots$&$3\_ec\ldots$\\
&&&$b$&$1\un{e}c\ldots$&$3\_ec\ldots$\\
&&&$\alpha$&$5\alpha c\un{a}\ldots$&$RHS$\\\hline
$19$&$2\un{d}d\ldots$&$3\_bc\ldots$&$b$&$1\un{d}d\ldots$&$4\_cb\ldots$\\
&&&$b$&$1\un{e}d\ldots$&$4\_cb\ldots$\\
&&&$\alpha$&$1\alpha d\un{a}\ldots$&$RHS$\\\hline
$20$&$2\un{d}d\ldots$&$3ca\ldots$&$\emptyset$&$\emptyset$\\\hline
$21$&$2\un{d}e\ldots$&$3\_bc\ldots$&$b$&$1\un{d}d\ldots$&$4\_cb\ldots$\\
&&&$b$&$1\un{e}d\ldots$&$4\_cb\ldots$\\
&&&$\alpha$&$5\alpha d\un{a}\ldots$&$RHS$\\\hline
$22$&$2\un{d}e\ldots$&$3ca\ldots$&$\emptyset$&$\emptyset$\\\hline
$23$&$3\un{a}b\ldots$&$2\_ae\ldots$&$a$&$5\un{c}a\ldots$&$5\_cc\ldots$\\
&&&$a$&$5\un{e}a\ldots$&$5\_cc\ldots$\\
&&&$b$&$3\un{e}a\ldots$&$4\_ca\ldots$\\
&&&$c$&$4\un{c}a\ldots$&$3\_bc\ldots$\\
&&&$\alpha$&$4\alpha a\un{a}\ldots$&$RHS$\\\hline
$24$&$3\un{a}b\ldots$&$3\_bc\ldots$&$a$&$5\un{c}a\ldots$&$3cb\ldots$\\
&&&$a$&$5\un{e}a\ldots$&$3cb\ldots$\\
&&&$b$&$3\un{e}a\ldots$&$4\_cb\ldots$\\
&&&$c$&$4\un{c}a\ldots$&$2\_ab\ldots$\\
&&&$\alpha$&$4\alpha a\un{a}\ldots$&$RHS$\\\hline
$25$&$3\un{a}b\ldots$&$1ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$26$&$3\un{a}b\ldots$&$3ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$27$&$3\un{a}c\ldots$&$2\_ab\ldots$&$a$&$5\un{c}a\ldots$&$3db\ldots$\\
&&&$a$&$5\un{e}a\ldots$&$3db\ldots$\\
&&&$b$&$3\un{e}a\ldots$&$4\_ca\ldots$\\
&&&$c$&$4\un{c}a\ldots$&$3ab\ldots$\\
&&&$\alpha$&$2\alpha a\un{e}\ldots$&$RHS$\\\hline
$28$&$3\un{a}c\ldots$&$3\_bc\ldots$&$a$&$5\un{c}a\ldots$&$3cb\ldots$\\
&&&$a$&$5\un{e}a\ldots$&$3cb\ldots$\\
&&&$b$&$3\un{e}a\ldots$&$4\_cb\ldots$\\
&&&$c$&$4\un{c}a\ldots$&$2\_ab\ldots$\\
&&&$\alpha$&$2\alpha a\un{e}\ldots$&$RHS$\\\hline
$29$&$3\un{a}c\ldots$&$3ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$30$&$3\un{a}e\ldots$&$2\_ab\ldots$&$a$&$5\un{c}a\ldots$&$3db\ldots$\\
&&&$a$&$5\un{e}a\ldots$&$3db\ldots$\\
&&&$b$&$3\un{e}a\ldots$&$4\_ca\ldots$\\
&&&$c$&$4\un{c}a\ldots$&$3ab\ldots$\\
&&&$\alpha$&$5\alpha a\un{b}\ldots$&$RHS$\\\hline
$31$&$3\un{a}e\ldots$&$1db\ldots$&$\emptyset$&$\emptyset$\\
\hline
$32$&$3\un{e}a\ldots$&$4\_ca\ldots$&$a$&$5\un{c}e\ldots$&$3\_bc\ldots$\\
&&&$a$&$5\un{e}e\ldots$&$3\_bc\ldots$\\
&&&$b$&$3\un{e}e\ldots$&$4bc\ldots$\\
&&&$c$&$4\un{c}e\ldots$&$1ab\ldots$\\
&&&$\alpha$&$1\alpha e\un{c}\ldots$&$RHS$\\\hline
$33$&$3\un{e}a\ldots$&$4\_cb\ldots$&$a$&$5\un{c}e\ldots$&$3\_bc\ldots$\\
&&&$a$&$5\un{e}e\ldots$&$3\_bc\ldots$\\
&&&$b$&$3\un{e}e\ldots$&$2ba\ldots$\\
&&&$c$&$4\un{c}e\ldots$&$3ab\ldots$\\
&&&$\alpha$&$1\alpha e\un{c}\ldots$&$RHS$\\\hline
$34$&$3\un{e}e\ldots$&$4\_ce\ldots$&$a$&$5\un{c}e\ldots$&$3\_bc\ldots$\\
&&&$a$&$5\un{e}e\ldots$&$3\_bc\ldots$\\
&&&$b$&$3\un{e}e\ldots$&$3bc\ldots$\\
&&&$c$&$4\un{c}e\ldots$&$3\_bc\ldots$\\
&&&$\alpha$&$5\alpha e\un{b}\ldots$&$RHS$\\\hline
$35$&$3\un{e}e\ldots$&$2ba\ldots$&$\emptyset$&$\emptyset$\\\hline
$36$&$3\un{e}e\ldots$&$3bc\ldots$&$\emptyset$&$\emptyset$\\\hline
$37$&$3\un{e}e\ldots$&$4bc\ldots$&$\emptyset$&$\emptyset$\\\hline
$38$&$4\un{b}b\ldots$&$4\_ce\ldots$&$b$&$4\un{b}b\ldots$&$3bc\ldots$\\
&&&$c$&$3\un{a}b\ldots$&$3\_bc\ldots$\\\hline
$39$&$4\un{b}b\ldots$&$2ba\ldots$&$\emptyset$&$\emptyset$\\\hline
$40$&$4\un{b}b\ldots$&$3bc\ldots$&$\emptyset$&$\emptyset$\\\hline
$41$&$4\un{b}b\ldots$&$4bc\ldots$&$\emptyset$&$\emptyset$\\\hline
$42$&$4\un{b}c\ldots$&$4\_ca\ldots$&$b$&$4\un{b}b\ldots$&$4bc\ldots$\\
&&&$c$&$3\un{a}b\ldots$&$1ab\ldots$\\
&&&$\alpha$&$2\alpha b\un{b}\ldots$&$RHS$\\
&&&$\alpha$&$3\alpha b\un{b}\ldots$&$RHS$\\\hline
$43$&$4\un{b}c\ldots$&$4\_cb\ldots$&$b$&$4\un{b}b\ldots$&$2ba\ldots$\\
&&&$c$&$3\un{a}b\ldots$&$3ab\ldots$\\
&&&$\alpha$&$2\alpha b\un{b}\ldots$&$RHS$\\
&&&$\alpha$&$3\alpha b\un{b}\ldots$&$RHS$\\\hline
$44$&$4\un{b}e\ldots$&$4\_cb\ldots$&$b$&$4\un{b}b\ldots$&$2ba\ldots$\\
&&&$c$&$3\un{a}b\ldots$&$3ab\ldots$\\\hline
$45$&$4\un{b}e\ldots$&$4\_ce\ldots$&$b$&$4\un{b}b\ldots$&$3bc\ldots$\\
&&&$c$&$3\un{a}b\ldots$&$3\_bc\ldots$\\\hline
$46$&$4\un{c}a\ldots$&$2\_ab\ldots$&$b$&$4\un{b}c\ldots$&$4\_ca\ldots$\\
&&&$c$&$3\un{a}c\ldots$&$3ab\ldots$\\
&&&$\alpha$&$5\alpha c\un{d}\ldots$&$RHS$\\\hline
$47$&$4\un{c}a\ldots$&$3\_bc\ldots$&$b$&$4\un{b}c\ldots$&$4\_cb\ldots$\\
&&&$c$&$3\un{a}c\ldots$&$2\_ab\ldots$\\
&&&$\alpha$&$5\alpha c\un{d}\ldots$&$RHS$\\\hline
$48$&$4\un{c}a\ldots$&$3ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$49$&$4\un{c}e\ldots$&$2\_ae\ldots$&$b$&$4\un{b}c\ldots$&$4\_ca\ldots$\\
&&&$c$&$3\un{a}c\ldots$&$3\_bc\ldots$\\\hline
$50$&$4\un{c}e\ldots$&$3\_bc\ldots$&$b$&$4\un{b}c\ldots$&$4\_cb\ldots$\\
&&&$c$&$3\un{a}c\ldots$&$2\_ab\ldots$\\\hline
$51$&$4\un{c}e\ldots$&$1ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$52$&$4\un{c}e\ldots$&$3ab\ldots$&$\emptyset$&$\emptyset$\\\hline
$53$&$4\un{e}c\ldots$&$2\_ec\ldots$&$b$&$4\un{b}e\ldots$&$4\_ce\ldots$\\
&&&$c$&$3\un{a}e\ldots$&$1db\ldots$\\
&&&$\alpha$&$2\alpha e\un{b}\ldots$&$RHS$\\
&&&$\alpha$&$3\alpha e\un{b}\ldots$&$RHS$\\\hline
$54$&$4\un{e}c\ldots$&$1cb\ldots$&$\emptyset$&$\emptyset$\\\hline
$55$&$4\un{e}c\ldots$&$3cb\ldots$&$\emptyset$&$\emptyset$\\\hline
$56$&$4\un{e}e\ldots$&$2\_ec\ldots$&$b$&$4\un{b}e\ldots$&$4\_ce\ldots$\\
&&&$c$&$3\un{a}e\ldots$&$1db\ldots$\\\hline
$57$&$4\un{e}e\ldots$&$1cb\ldots$&$\emptyset$&$\emptyset$\\\hline
$58$&$4\un{e}e\ldots$&$3cb\ldots$&$\emptyset$&$\emptyset$\\\hline
$59$&$5\un{c}a\ldots$&$5\_cc\ldots$&$a$&$4\un{e}c\ldots$&$2\_ec\ldots$\\\hline
$60$&$5\un{c}a\ldots$&$3cb\ldots$&$\emptyset$&$\emptyset$\\\hline
$61$&$5\un{c}a\ldots$&$3db\ldots$&$\emptyset$&$\emptyset$\\\hline
$62$&$5\un{c}e\ldots$&$3\_bc\ldots$&$a$&$4\un{e}c\ldots$&$3cb\ldots$\\\hline
$63$&$5\un{c}e\ldots$&$3ca\ldots$&$\emptyset$&$\emptyset$\\\hline
$64$&$5\un{e}a\ldots$&$5\_cc\ldots$&$a$&$4\un{e}e\ldots$&$2\_ec\ldots$\\\hline
$65$&$5\un{e}a\ldots$&$3cb\ldots$&$\emptyset$&$\emptyset$\\\hline
$66$&$5\un{e}a\ldots$&$3db\ldots$&$\emptyset$&$\emptyset$\\\hline
$67$&$5\un{e}e\ldots$&$3\_bc\ldots$&$a$&$4\un{e}e\ldots$&$3cb\ldots$\\\hline
$68$&$5\un{e}e\ldots$&$3ca\ldots$&$\emptyset$&$\emptyset$\\\hline
\end{longtable}
\fontsize{12}{14}\selectfont
\section{\label{section4}Reformulating the generation of new IRR's from existing ones in terms of IRR generating rules}
In order to understand how IRR's can be generated from others, the following IRR of length 6 was chosen from the computer program output and represented in $\text{Origin}\to\text{LHS}\to\text{RHS}$ format as follows:
\begin{equation}\label{eq130}3\un{a}ecccb\to1cadbd\un{b}\to 2dbdbdb\_.\end{equation}
The derivation of the first rule of \eqref{eq130} in single TM steps is
\begin{equation}\begin{array}{l}3\un{a}ecccb\\4c\un{e}cccb\\5ca\un{c}ccb\\3caa\un{c}cb\\2ca\un{a}acb\\1cac\un{a}cb\\
2ca\un{c}dcb\\1cad\un{d}cb\\2cadb\un{c}b\\1cadbd\un{b}\end{array}.\end{equation}
Each time the pointer moves to where it has not been before while going backwards from the LHS, it generates IRR's as follows in triplet and the abbreviated notation:
\begin{equation}\label{irr_array}\begin{array}{cc}\begin{array}{l}
2\un{c}b\to1d\un{b}\to5\_cd\in IRR(2)\\
1\un{d}cb\to 1bd\un{b}\to 3\_ecd\in IRR(3)\\
2\un{c}dcb\to 1dbd\un{b}\to 5\_cecd\in IRR(4)\\
4\un{e}cccb\to 1adbd\un{b}\to 2\_ececd\in IRR(5)\\\end{array}&
\begin{array}{l}2\un{c}b\to\to5\_cd\\1\un{d}cb\to\to3\_ecd\\2\un{c}dcb\to\to 5\_cecd\\4\un{e}cccb\to\to2\_ececd\end{array}\end{array}.
\end{equation}
The abbreviated forms can be obtained by applying in order the following first 3 results to the first of these IRR's $2\un{c}b\to\to5\_cd$. For the first and third of these steps, there are two options, the first one of which needs to be chosen to obtain \eqref{eq130}:
\begin{equation}\label{f_array}\begin{array}{ccc}2\un{c}\ldots\to\to5\_c\ldots &\stackrel{b}{\Rightarrow}& \left.\begin{array}{l}1\un{d}c\ldots\\1\un{e}c\ldots\end{array}\right\}\to\to3\_ec\ldots\\[10pt]
1\un{d}\ldots\to\to3\_e\ldots&\stackrel{d}{\Rightarrow}& 2\un{c}d\ldots\to\to5\_ce\ldots\\[5pt]
2\un{c}d\ldots\to\to5\_ce\ldots&\stackrel{a}{\Rightarrow}&\left.\begin{array}{l}4\un{e}cc\ldots\\4\un{e}ec\ldots\end{array}\right\}\to\to2\_ece\ldots\\[10pt]
4\un{e}\ldots\to\to2\_e\ldots&\stackrel{c}{\Rightarrow}& 3\un{a}e\ldots\to\to1d\un{e}\ldots\end{array}\end{equation}

Equation \eqref{f_array} contains examples of IGR's (IRR generating rules) that allow one IRR to be derived from another simply by substituting for the $\ldots$ as the example shows, and express the application of the function $F$ in Theorem~\ref{irr_ind_thm} in a simpler form.
When represented like this, the length of an IGR will be defined as the length of the strings on its RHS, which will always be one more than the length of the strings on its LHS, and will be $\ge 2$.
The symbols above the implication signs are the symbol added next to the pointer in the origin ($\alpha$) in the derivation of the IRR's from other ones given in Section~\ref{sec2}, and are the first 4 symbols of the LHS of IRR \eqref{eq130} taken in reverse order. The results on the right in \eqref{f_array} are not necessarily all the results that can be derived from their LHS for that value of $\alpha$ so they could be described as IGR elements. A complete IGR is defined to include all the possible results that can be derived for the number of symbols given for any possible value of $\alpha$, but if there is not likely to be confusion I will refer to such statements as IGR's.

Because the derivation of the \eqref{f_array} does not involve changing any symbol in the $\ldots$ either on the left or the right of the $\to\to$, clearly the $\ldots$ on the left of both sides of the statement must be the same, likewise for the right hand sides, but there no connection between them.

The IRR outline on the RHS of the last member of \eqref{f_array} is of type RR so does not generate a new IRR directly. Applying the last member of \eqref{f_array} gives the initial result \begin{equation}3\un{a}ecccb\to1cadbd\un{b}\to1d\un{e}cecd\end{equation} which is not an IRR. Taking this computation as far a possible is a result of applying $F$ to last member of \eqref{irr_array} so it has to be an IRR (in this case of non-extendable type RR) which for $\alpha =c$ is
\begin{equation}\label{final}3\un{a}ecccb\to\to 2dbdbdb\_\end{equation} in agreement with \eqref{eq130} (it is straightforward to show that the only other result of applying $F$ to the last member of \eqref{irr_array} is $4\un{b}ecccb\to\to 4\_cececd$ with $\alpha = b$).
This illustrates the general procedure for deriving any IRR by repeated applications of $F$ starting from a member of IRR(2). Furthermore it classifies each application of $F$ (an IGR) by an integer $k\ge 2$ known as its length. It also suggests that there is a procedure for obtaining the IGR's of length $k$ (members of IGR($k$)) that when combined could generate some IRR($n$) for $n>>k$.

Consider again in detail the general form of the derivation of an IRR from an existing one. Start with the IRR of type RL\begin{equation}\label{igr0}t_1\un{y_{1}}\ldots y_{p}\to\to t_2\_z_{1}\ldots z_{p}\end{equation} where the $t$'s are machine states and $y$'s and $z$'s are symbols. Proceed as usual with $F$ i.e. add $\alpha$ on the left and right giving $t_1\alpha\un{y_1}\ldots y_p\to\to t_2\un{\alpha}z_1\ldots z_p$ and starting from $t_1\alpha\un{y_{1}}\ldots y_{p}$ find the new endpoints of the backward search that have the pointer at either end of the extended string that could be none, one or many from the branches of the backward search, and do this for each value of $\alpha$. For each value of $\alpha$ having at least one endpoint on the left (a new origin), the new RHS is computed. The backward searches can be classified according to the rightmost position ($\alpha$ has position 1) $r_1$ of the pointer satisfying $2\le r_1\le p+1$. If the endpoint is at the left where the symbol $\alpha$ was, the backward search terminates because the reachability of the LHS has been established (see Lemma~\ref{lemma1}). If the the pointer goes to the right end in the backward search at CS A say then $r_1=p+1$ and the computation can continue backwards from $A$ because when extra context symbols are added, CS's such as $A$ can be starting points for further backward searching. These results cannot directly lead to a new IRR and should be included in the set of alternative origins.

If associated with the original IRR \eqref{igr0} there already are some origins of this sort, $\alpha$ is just added on the left to them and no backward searching will give anything new. 

If the pointer ends up at the left (a new origin) then clearly we can have $2\le r_1\le p$ but we cannot then have
$r_1=p+1$. This condition is needed in order to avoid obtaining the IRR outline $Y$ more than once on the right of the $\Rightarrow$ representing $F$: in the backward search the pointer cannot reach the opposite end of the string from the $\alpha$ and then return to where the symbol $\alpha$ is. If this did happen, a derivation of the same IRR outline $Y$ would be obtained from another IRR outline $X_2$, different from $X_1$, having as LHS the CS reached when the pointer first reaches the opposite end of the string from the symbol $\alpha$ in the backward search. For example without following this rule it is possible to have two derivations as follows (note the reversal of the orientation here with the $\alpha$ on the right):
\begin{equation} \left.\begin{array}{l}(X_1)\text{ } 4\ldots c\un{d}\to\to 2\ldots db\_\\(X_2)\text{ }3\ldots a\un{c}\to\to 2\ldots db\_\end{array}\right\}\Rightarrow  (Y)\text{ }5\ldots cd\un{d}\to\to 1\ldots dbc\_.\end{equation} This rule would disallow the second derivation. The two IRR outlines on the left have different LHS's which are the middle elements in the triplet of an IRR outline that can usually be not mentioned, and the derivations share much in common as can be seen by single stepping through them.

Analogous to $F^{-1}$ being unique for IRR's, there is a condition that can be applied to the way $F$ is obtained to ensure that $F^{-1}$ is also unique for abbreviated IRR's with the middle element (the LHS) missing from the triplet form (an IRR pair). The above example illustrates this problem.
\begin{Theorem}\label{thm2}
$F^{-1}$ is unique for IRR pairs if in the backward search involved in calculating $F$ for IRR pairs, whenever the pointer reaches the opposite end of the string from the $\alpha$ and then returns to where the symbol $\alpha$ is, the backward search stops and the resulting CS is ignored.
\end{Theorem}
\begin{proof}
Suppose the following is possible
\begin{equation}\label{hyp}\left.\begin{array}{l}A^1_1\to\to C^0_1\\A^1_2\to\to C^0_2\end{array}\right\}\stackrel{F}{\Rightarrow} A^1_3\to\to C^0_3\end{equation} where I have used superscripts to represent the position of the pointer in the CS's and the  IRR pairs on the LHS have length $n$. In what follows $\stackrel{F}{\Rightarrow}$ will just be written as $\Rightarrow$ as usual.
Doing $F$ starts with adding $\alpha$ on the left which increases all the pointer positions by 1 therefore $\alpha_1 A^2_1\leftarrow A^1_3$ and $\alpha_2 A^2_2\leftarrow A^1_3$ because $A^1_3$ is the new origin, and $\alpha$ could be different in the two cases. Therefore doing forward TM computation from $A^1_3$ both $\alpha_1 A^2_1$ and $\alpha_2 A^2_2$ are reached and we can suppose without loss of generality that $\alpha_1 A^2_1$ is reached first. The pointer can never reach position 1 in these computations because it would imply the pointer reaching position 0 in either of the LHS's of \eqref{hyp} which only happens when one of the CS's $C$ is reached. Therefore between $\alpha_1 A^1_1$ and $\alpha_2 A^1_2$ the pointer never reaches the $\alpha$ position, so $\alpha_1=\alpha_2=\alpha$ say.
The first time the pointer gets to position 1 when starting from $A^1_3$ is when it gets to $\un{\alpha} C^0_1$ in the first case and $\un{\alpha}C^0_2$ in the second case, and because these are the same computation, $C^0_1=C^0_2$. The computation on the RHS of \eqref{hyp} can now be written as
\begin{equation}\label{hyp_rhs}A^1_3\to\alpha A^1_1\to \alpha B^n_1 \to \alpha A^1_2\to \alpha B^n_2\to \un{\alpha} C^0_1\to C^0_3\end{equation}
where $B^n_1$ and $B^n_2$ are the LHS's in the IRR triplets $Y_1=A^1_1\to B^n_1\to C^0_1$ and $Y_2=A^1_2\to B^n_2\to C^0_1$ representing the IRR pairs on the LHS of \eqref{hyp}. The placement of $\alpha B^n_2$ is determined by $Y_2$, and the placement of $\alpha B^n_1$ cannot be between $\alpha A^1_2$ and $\un{\alpha}C^0_1$ because by lemma~\ref{lemma1} the origin of $Y_1$ must be where for the first time the pointer reaches position 1 while going backwards from the LHS which is $B^n_1$. Then putting $\alpha$ on the left of $Y_1$ and $Y_2$ starts the derivation of the RHS of \eqref{hyp} which is \eqref{hyp_rhs}. This situation resulting from \eqref{hyp} cannot arise if the backward search beyond $\alpha A^1_2$ reaching $\alpha B^n_1$ before finally reaching $A^1_3$ is ignored beyond $\alpha B^n_1$ i.e. it is as if this CS terminates the search. This is alright because the full form \eqref{hyp_rhs} is included in the first part of \eqref{hyp} i.e. $Y_1\Rightarrow A^1_3\to\to C^0_3$
\end{proof}

Similarly for the computation of the new RHS, the results can be classified by the rightmost position $r'_2$ of the pointer. It starts at position 1 and ends at position 0 if it goes left (therefore $1\le r'_2\le p+1$) and ends at position $p+2$ if it goes right. The general forms of these results for the new origins are, excluding stationary cycles,
\begin{equation}\label{igr1}t_1\alpha \un{y_1}\ldots y_p\leftarrow \left\{\begin{array}{l}t'_1\un{\alpha}y'_1\ldots y'_{r_1-1}y_{r_1}\ldots y_p\text{ where }2\le r_1\le p\text{ or}\vspace{0.5em}\\t'_1\alpha y'_1\ldots y'_{p-1}\un{y_p}\text{ if }r_1=p+1\end{array}\right..\end{equation}




Similarly the computation of the new RHS's gives
\begin{equation}\label{igr2}t_2\un{\alpha}z_1\ldots z_p\to \left\{\begin{array}{l}t'_2\_\alpha' z'_1\ldots z'_{r'_2-1}z_{r'_2}\ldots z_p\text{ where }1\le r'_2\le p+1\text{ or}\vspace{0.5em}\\  t'_2\alpha'z'_1\ldots z'_p\_\text{ if }r'_2=p+2\end{array}\right..\end{equation}
The reason for the notation $r'_2$ instead of $r_2$ is that the minimum number of symbols needed for the representation of the result of applying $F$ to \eqref{igr0} is \begin{equation}\label{def_r}r=\text{max}(r_1,r_2)\text{ where }r_2=\text{min}(r'_2,p+1).\end{equation}

If a stationary cycle occurred in \eqref{igr1} it would be noted, but it would have no effect on the general form of the possible results because it would result in a closed circuit in the reverse search path from which  paths ending in either type of endpoint in \eqref{igr1} could diverge. If this happened in \eqref{igr2} this result would also be noted, and the absence of an RHS as described would lead to the absence of a new IRR where one was expected.

In \eqref{igr1} and \eqref{igr2} there are 4 cases to be considered because the backward search to get the new origin and forward computation to get the new RHS can each take the pointer to the left or the right independently. Of these, two have $r_1=p+1$ and the result is not an IRR because the LHS is not proved to be reachable. The remaining cases are (1) $2\le r_1\le p\text{ and }1\le r'_2=r_2\le p+1$ where the derived IRR is of extendable (RL) type, the derived IRR has the form $1\to r_1\to 2\to p+1\to 1\to r'_2=r_2\to 0$, and (2) $2\le r_1\le p\text{ and }r'_2=p+2$ (and $r_2=p+1$) where the derived IRR has type RR and the form $1\to r_1\to 2\to p+1\to 1\to p+2$, where the numbers indicate the pointer position at some extreme points in the computation and $\alpha$ is at position 1. In case (1), Equation \eqref{igr0} leads to the following derived IRR $t'_1\un{\alpha}y'_1\ldots y'_{r_1-1}y_{r_1}\ldots y_p\to\to t'_2\_\alpha'z'_1\ldots z'_{r_2-1}z_{r_2}\ldots z_p$, which can be written if $r_1\le r_2$ without redundant symbols as
\begin{equation}\label{igr3}\begin{array}{l}t_1\un{y_{1}}\ldots y_{r_2-1}\ldots\to\to t_2\_z_{1}\ldots z_{r_2-1}\ldots\Rightarrow\\ t'_1\un{\alpha}y'_1\ldots y'_{r_1-1}y_{r_1}\ldots y_{r_2-1}\ldots\to\to t'_2\_\alpha'z'_1\ldots z'_{r_2-1}\ldots\end{array}\end{equation}while if $r_2\le r_1$, then similarly the following is obtained:
\begin{equation}\label{igr4}\begin{array}{l}t_1\un{y_1}\ldots y_{r_1-1}\ldots\to\to t_2\_z_1\ldots z_{r_1-1}\ldots\Rightarrow\\
t'_1\un{\alpha}y'_1\ldots y'_{r_1-1}\ldots\to\to t'_2\_\alpha'z'_1\ldots z'_{r_2-1}z_{r_2}\ldots z_{r_1-1}\ldots\end{array}.\end{equation} In case (2) the following is obtained:
\begin{equation}\label{igr5}t_1\un{y_1}\ldots y_p\to\to t_2\_z_1\ldots z_p\Rightarrow\\
t'_1\un{\alpha}y'_1\ldots y'_{r_1-1}y_{r_1}\ldots y_p\to\to t'_2\alpha'z'_1\ldots z'_p\_.\end{equation}
For case (1), the result \eqref{igr3} having $r_2$ symbols on the right and one fewer without the $\alpha$ on the left, is defined to have length $r_2$. Likewise \eqref{igr4} has length $r_1$.

The derivation above shows that a single application of $F$ consists of, in case (1), substituting the symbols specified in \eqref{igr3} or \eqref{igr4} such that the $\ldots$ on the right of the strings in the origins each side of the $\Rightarrow$ are the same, and so are the $\ldots$ on the right of the strings in the RHS's each side of the $\Rightarrow$, but there is no connection between them, and in case (2), applying the result \eqref{igr5}. The forms \eqref{igr3}, \eqref{igr4} and \eqref{igr5} are defined to be (possibly subsets of) IRR generating rules (IGR's), the complete IGR's having the full list of IRR outlines on the RHS of the $\Rightarrow$ corresponding to the single IRR outline on the left. This full list of results for all values of $\alpha$ all have the same value of $r\le p+1$ which is the definition of the length of the IGR.
\label{key}

The above argument shows, when combined with Theorem~\ref{irr_ind_thm}, that\\
(1) every IRR of length $p+1$ of type RL can be derived by $F$ from another IRR of length $p$ of type RL by an IGR with parameters $r_1$ and $r_2$ as described and\\(2) every IRR of length $p+1$ of type RR can be derived by $F$ from another IRR of length $p$ of type RL by an IGR with parameter $r=r_2=p+1$.

As usual, of course the mirror image results of everything in this section hold with the $\alpha$ and $\ldots$ on opposite sides and with right and left exchanged etc.

These can be applied recursively to show that 
\begin{Theorem}any extendable IRR (type RL or LR) of length $\ge 3$ can be obtained from a member of IRR(2) by a sequence of substitutions of IGR's as described here under case (1). Any non-extendable IRR (type LL or RR) can be obtained from a member of IRR(2) by the above substitutions (0 or more) followed by a single substitution step under case (2).
\end{Theorem}

This theorem is illustrated by the example at the beginning of this section.
\newline\newline
\section{\label{section5}Another look at IGR's and their derivations from others}
There were many questions involving the exact definition of IGR's which had to be resolved which has caused some difficulties writing this paper. This was because my ideas were changing during working out many examples. These mainly involved how to handle RHS's with different lengths, excluding redundant symbols, alternative origins, labelling the RHS's with appropriate value of $\alpha$, multiple origins leading to multiple RHS's (i.e. are they all one IGR or many).

In all that follows, there are right-left reversed forms of IRR outlines and IGR's with $\alpha$ and $\ldots$ on opposite sides of the strings of symbols.

\begin{comment}
Example 6 makes it clear that the result of the backward search is (1) a set of endpoints where the pointer is at $\alpha$ and (2) a set of results where the pointer is at the other end of the string (any other results where the pointer stops midway are not useful). The set (1) appear as origins, organised by the value of $\alpha$ to which they refer, in new IRR outlines as the result of applying $F$ to the original IRR outline. On the other hand the set (2) are starting points where an extra symbol $\beta$ could be added at the opposite end of the string from $\alpha$ in order to derive $F$ applied to the original IRR outline modified by elongating its origin by the one symbol $\beta$ i.e. the first context symbol is $\beta$. Because the pointer never reaches $\alpha$, $\alpha$ cannot affect any other symbol in these results. The result of applying $F$ should include the derived IRR outlines with their RHS's as before and the set (2) of starting points for further backward searches as mentioned above. These will be listed as a set after the set of derived outlines. In order to avoid repetition in these searches, the first reverse TM step must be to $\beta$ then the reverse search continues as before as far as possible in each branch. 

There is however another way in which a new IRR outline could be derived. By referring to the result of the part of the search that was done previously i.e. from the IRR outline with single symbol nearest the $\ldots$ removed (if this IGR 
is not already done it will have to be added), if this IGR has as its RHS of non-extendable type, then this symbol can be put back and the computation continued to get the new RHS that may be extendable or not,

For this reason, in the first instance regard this case as done and likewise apply $F$ to all the RHS's of extendable IRR outlines shortened to length 1 in () - () that do not appear in their LHS's and do this until closure i.e. all the RHS's of extendable IRR outlines in the RHS's of the extended set also appear in their LHS's. Next take the RHS's of this list (length 3) of the results of applying F to the RHS's of the first set and apply $F$ to these as above to closure for IRR(1) outlines ignoring the analogues of the earlier results. In these closure procedures the length of the IRR outline used and the number of steps of $F$ used and the number of steps of $F$ from the IRR(1) outlines at the start could vary. Drop off the contexts to get more useful results initially, then add them back later.

An IGR element whose RHS is formed under case (1) in Section~\ref{section4}, is the LHS of another IGR (that could be vacuous). If it is formed under case (2) of Section~\ref{section4}, it cannot be the LHS of another IGR, but it could form part of the RHS of another IGR under case (1) or (2) of greater length as follows. If in the first member of \eqref{igr1}, the length of the original IRR $p$ was sufficiently short that the pointer ends up to the right and so gives a result of the form of the second member of \eqref{igr1}. Therefore it is reasonable to suppose that if \eqref{igr4} occurs, as in the example \eqref{f_array}.4, if extra symbols on the right were added a result like the first member of \eqref{igr1} could occur (\eqref{final} in the example) i.e.\eqref{igr4} is a potentially incomplete IGR of greater length.
\end{comment}

In Section~\ref{section4} a general description  was given of how to find the IGR of minimal length to extend a given extendable IRR of length $p$ to one of length $p+1$. This was a reformulation of the process described in Theorem~\ref{irr_ind_thm}. Here the main interest is in obtaining IGR's from other ones so as to generate, if possible, the complete set of IGR's for the TM. 

Precise definitions of IRR outlines and IGR's are needed to take the next steps. An IRR outline is the set of IRR's with fixed values of the given symbols i.e. $\ldots$ means a string of symbols of arbitrary length including zero. The two occurrences of $\ldots$ can be different but they are of the same length. An IGR is a set of logical implications starting from a fixed IRR outline on the left where in each member a single application of the process in \eqref{irr_ind} is applied. IGR's from now on will be expressed in terms of IRR outlines. Thus an IGR member is of the form
\begin{equation}\un{A}\ldots\to\to \_B\ldots\Rightarrow \un{C}\ldots\to\to D\ldots,S\end{equation}
where each of $A,B,C$ and $D$ are combinations of machine state, string of symbols, and the pointer position. The pointer positions in $A$ and $C$ are at position 1 i.e. the left hand end of the string, and in $B$ it is to its immediate left as shown, and the pointer position in $D$ can be immediately to the left or right of the string. If it is to the right the pointer position will not be shown and replaced by $\ldots$. The string components of $A,B$ have the same length $p$, and those of $C$ and $D$ have length $p+1$. 

An IRR outline is in general associated with a set $S$ of alternative origins (with the pointer reaching the opposite end of the string from $\alpha$) that do not establish the reachability of the LHS in an IRR and $S$ is only there so that when an extra context symbol is added there is a possibility that an new origin is found that does generate a new IRR which would otherwise have been missed. $S$ arises only as a result of the abbreviation of IRR's to IRR outlines in the method of applying $F$ to an IRR outline as described in Table~\ref{Table3} below. It is very useful in the short-cut method of carrying out $F$ which is a time saving device avoiding duplication of calculations because members of $S$ are (with an added symbol) possible intermediates in the calculation of new origins from the original ones in the calculation of $F$, see example 14 in Section~\ref{section7}. If the $\ldots$ to the right of $\Rightarrow$ in an IGR outline are the empty string then any alternative origins that would be in $S$ are of no further use and could be ignored. If $S$ is not mentioned it will be assumed that $S=\emptyset$. In the case that $S\ne\emptyset$ the values of $\alpha$ must be given alongside the RHS's to which they refer because $\alpha$ is present in each member of $S$ and can affect the computation of the new origin, and it also determines which RHS is produced.

An IGR will have no redundant symbols where the pointer does not reach during its derivation. This is analogous to IRR's being irreducible. Thus in the derivation of the IGR, the backward search to obtain $C$ and in the forward computation to obtain $D$, the pointer never moves outside where strings $C$ and $D$ are, except for the last machine step obtaining $D$ that takes the pointer just outside $D$. This is in contrast with the derivations of the separate LHS and RHS IRR outlines of the IGR, where the pointer could move further right than this. Therefore the number of symbols retained for each new origin found and RHS must be $r$ as defined in Equation~\eqref{def_r}, and any extra symbols used in specific cases will be listed as ``context pairs" that can be used to extend the left and right symbol strings respectively on both sides of the logical implication statement as described later (this is not now an IGR). Thus it would be possible for different RHS's of the IGR to have different values of $r$ corresponding to different values of $\alpha$, however as will be seen later these will be separated into different IGR's. 

Expressing the results of Section~\ref{section4} in terms of IRR outlines together with contexts to account for the symbols that are not used, gives a more informative description of the algebra  than is given on page~\pageref{key}. Specifically, any IRR outline $X$ of length $p$ of extendable type can lead under $F$ to other IRR outlines of length $r$ of extendable type with parameters $r_1$ and $r_2$ as above satisfying $2\le r_1\le p$ and $1\le r_2\le p+1$. Thus $2\le r\le p+1$ where $r=max(r_1,r_2)$ is the length of the derived IRR outline and the IGR. In each of these cases there is a pair of context strings of length $p+1-r$ that need to be added to the IRR outline to take the total length of the derived IRR outline to $p+1$. Alternatively if the derived IRR outline is non-extendable, its length will be $p+1$.

\begin{comment}Otherwise the only difference is that the computation on the right proceeds as far as possible from where pointer would be stopped i.e. the left end of string $B$. This is actually a subset: $A$ is now of the form $pA'$ and $B$ is now of the form $qB'$. Note that this could be empty because $I$ determines the set of pairs $(A,B)$. check notation!\end{comment}





As a result of applying $F$ to \begin{equation}\label{gen_irr_outline}t_1\un{y_1}\ldots y_p\ldots\to\to t_2\_z_1\ldots z_p\ldots,S\end{equation} first consider the IRR outline. After adding $\alpha$ on the left of the strings in the origin and RHS,
there are two possible types of new origin as a result of the backward search from the origin of \eqref{gen_irr_outline}: (1) with the pointer at $\alpha$ and $2\le r_1\le p$ or (2) with the pointer at $y_p$ and $r_1 = p+1$. This latter type of result does not allow a proof of the reachability of the LHS so does not lead to an IRR outline (an alternative origin), but it could be the starting point of further computations to get an origin that does so.
\begin{comment}i.e. when further backward searching takes the pointer back to $\alpha$. at position 1. Then a result of the form $1\to p+1\to 0$ is obtained with a middle member different from that in \eqref{gen_irr_outline} which is where the pointer gets to $y_p$.
\end{comment}
Let the set of these be $S^*$ to which $S$ each member of which has $\alpha$ added on the left i.e. $\alpha S$  must be added i.e. the new $S$ is $S'=S^*\cup\alpha S$. This is because in $\alpha S$ the backward search has no effect because it has already been done to get $S$. The set $S$ was given after the IGR in the examples, and is independent of the IRR outline on the right of the IGR and therefore unique for an IGR with multiple RHS's. On the right there are also two types of RHS, (3) with the pointer immediately left of $\alpha$ and $1\le r_2\le p+1$ giving an extendable IRR outline, and (4) with the pointer at $z_{p+1}$ and $r_2=p+2$ giving a non-extendable IRR outline. The result of applying $F$ is then the union over $\alpha$ of all possible pairs of origin under case (1) and RHS, and $S'$. 

One approach that became obvious after studying many examples is to relate the results in Section~\ref{section4} to the same thing with the context $(y_{p+1},z_{p+1})$ applied to the original IRR i.e. apply $F$ to\begin{equation}t_1\un{y_1}\ldots y_{p+1}\ldots\to\to t_2\_z_1\ldots z_{p+1}\ldots,Sy_{p+1}.\end{equation}

The effect of adding the context on the right of the symbol strings on the origin of \eqref{gen_irr_outline} is if, $2\le r_1\le p$ and the pointer is at $\alpha$ (case 1), just to add $y_{p+1}$ to the symbol string. If $r_1 = p+1$ with the pointer at $y_p$ with $y_{p+1}$ on its right (case 2), there are now two cases: (5) $y_{p+1}$ is not reached, $r_1 = p+1$ and a new origin of IRR's is found, and (6) $y_{p+1}$ is reached in one step by the pointer and $r_1 = p+2$ i.e. new alternative origin is found that must be added to the new set $S'$. Tracing this further back may yield other alternative origins, but by Theorem~\ref{thm2} not to a regular origin. Cases 1 and 5 are trivial in that no backward searching is needed.
Likewise the symbol $y_{p+1}$ must also be added to all the old members of $S$ on the right and the backward search continued to get either case 5 or case 6. 

On the right, again there are two cases that are non-trivial (other than when $1\le r_2\le p+1$ with the pointer left of $\alpha$ when $z_{p+1}$ is just added to the string) when pointer reaches $z_{p+1}$ and $r_2 = p+2$ (7) the pointer ends up left of $\alpha$ and $r_2 = p+2$ giving an extendable IRR outline, and (8) the pointer ends up right of $z_{p+1}$ and $r_2 = p+3$, giving a non-extendable IRR outline.

\begin{comment}
In each case to get a non-trivial origin or RHS, the pointer must reach where the new added symbol is (i.e. the opposite end of the string from the pointer) before returning. Need examples of the 4 cases. Use tabular form for this.
\end{comment}
\fontsize{10}{10}\selectfont
\begin{longtable}{c|c|c||c|c|c}\caption{Generating a new IGR $B$ from an IGR $A$ defining the action of $F$ on IRR $X$ of type RL and length $p$ using $X$ with an extra context pair of symbols.}\label{Table3}\\
\multicolumn{3}{c||}{Origins}&\multicolumn{3}{c}{RHS's}\\
\hline
&pointer position&$r_1$&&pointer position&$r_2$\\
\hline
Case 1& $1$ i.e. $\alpha$&$2\le r_1\le p$& Case 3& $0$& $1\le r_2\le p+1$\\
Case 2& $p+1$ i.e. $y_p$&$p+1$&Case 4&$p+2$&$p+2$\\
\hline
\multicolumn{6}{c}{After adding context ($y_{p+1}$, $z_{p+1}$) to IRR $X$}\\
\hline
Case 5&$1$&$p+1$&Case 7&$0$&$p+2$\\
Case 6&$p+2$&$p+2$&Case 8&$p+3$&$p+3$\\
\end{longtable}
\fontsize{12}{14}\selectfont
Table~\ref{Table3} summarises the above results, numbering the cases in the same way. The notation $\alpha$,$r_1$,$r_2$,$p$,$y_p$,$y_{p+1}$,$z_{p+1}$ is as in the development in Section~\ref{section4}. ``pointer position" refers to the situation after the application of $F$, for the origin and RHS, with and without the extra context $(y_{p+1},z_{p+1})$ applied to $X$ that elongates $X$ by one symbol in a general way.
The cases for the origins and for the RHS's are independent, so you cannot read right across the table and all four combinations 13,14,23,24 of cases are possible after applying $F$ to the original IRR $X$. Likewise after adding the context all four combinations 57,58,67,68 are possible, but cases 5 or 6 require first reaching case 2, and cases 7 and 8 require first reaching case 4. In general there may be none or more instances of cases 1,2,5,6 for a fixed $X$, in general dependent on the value of $\alpha$ only for cases 1 and 5. For the RHS's, because forward computation is unique, either case 3 or 4 must occur with only one instance possible in either case for each allowed value of $\alpha$ (i.e. that has an instance of case 1), and likewise for cases 7 and 8 that has an $\alpha$ satisfying case 5.

Because both the forward and backward computations after adding the context can continue, due to the single extra symbol in each case, the results obtained after adding the context depend on the results without the context addition. For the backward search to continue needs case 2, and for the forward computation needs case 4. If neither of these happen, the combination 13, $B$ is a trivial extension of $A$ by the context and although it is a new extendable IRR it is a trivial extension and will thus not be recorded. The combination 14 gives a non-extendable IRR that is recorded. For combinations 23 and 24 see cases 2,6 below.

Table~\ref{Table3} shows that a consequence of adding the extra context symbol $y_{p+1}$, in order to get a non-trivial result that needs to be recorded, must be for the pointer to reach this symbol (because the backward search had gone as far as possible without it initially) then go as far as possible in either direction. A similar result holds when doing the forward computations.

\begin{longtable}{l|l}\caption{The meanings of the cases}\\
Cases&meaning\\\hline
1,5 & New origin results demonstrating reachability of the LHS (not shown)\\
& which is required for generating a new IRR\\
2,6 & Origins that don't confer reachability to the LHS so don't result in a\\
& new IRR. They have $\alpha$ as a parameter.  $\alpha$ is not involved in\\
& the backward search so the results if any are valid whatever the value\\
& of $\alpha$. Although they do not lead to generation a new IRR,\\
& this could happen after application of further contexts. They are\\
& listed as the set $S$ in the examples as part of the application\\
& of $F$ for this purpose.\\
3,7& RHS of a new extendable IRR of type RL.\\
4,8& RHS of a new non-extendable IRR of type RR.\\
\end{longtable}
\begin{comment} 
\subsection{IGR's with context strings and the application of $F$ to them}
\begin{Theorem}\label{thm4.2}
For any IRR outline $I$ and any pair of symbols $y_{p+1}$ and $z_{p+1}$, for all $\alpha$ combined \begin{equation}\label{eq_thm4.2}\stackrel{F\left(I+(y_{p+1},z_{p+1})\right)}{\text{ cases 67 and 68}}= \stackrel{(F(I)+(y_{p+1},z_{p+1}))}{\text{ cases 57,58}}\cup F^*(I+(y_{p+1},z_{p+1}))\end{equation} where the last term is the subset of  $F(I+(y_{p+1},z_{p+1}))$ such that the reverse search from the origin of $I$ with $\alpha$ on the left reaches a symbol to the immediate right of the string in $I$ before eventually reaching just outside the string at the extreme left or right.
\begin{proof}
In the following $\alpha$ plays its usual role as an arbitrary symbol.
Let $I$ be the IRR outline $\un{W}\ldots\to\to\_X\ldots$ of extendable type i.e. the pointer is explicit in the notation for the RHS, and where the pointer is on the left of the string in $W$. Then $I\text{ context }(y_{p+1},z_{p+1}) = \un{W}y_{p+1}\ldots\to\to \_Xz_{p+1}\ldots$.
The computation of $F(I)$ starts with the backward search $\alpha\un{W}\ldots\leftarrow \un{Y}\ldots$ say. There are in general many such $Y$'s.
These all have the pointer at the left because the other cases generate results that do not prove the reachability of the LHS in the IRR and are put into $S$ in the definition of $F$.
Each of these $Y$'s has an associated $\alpha$ and the RHS of $F(I)$ is the result of forward computation from  $\un{\alpha} X\ldots\to Z\ldots$ say. $F(I)$ is the union over $\alpha$ of the set of IRR all outlines $\un{Y}\ldots\to\to Z\ldots$ so obtained. This can include cases where $Z$ has the pointer just outside it at the left or right therefore a typical member of $F(I)\text{ context }(y_{p+1},z_{p+1})$ is $\un{Y}y_{p+1}\ldots\to\to Zz_{p+1}\ldots\to Q\ldots$ say i.e. $\un{Y}y_{p+1}\ldots\to\to Q\ldots$ where $Q$ has the pointer just outside it at the left or right. Next consider the computation of $F\left(I\text{ context }(y_{p+1},z_{p+1})\right)$. The result of the backward search includes $\alpha\un{W}y_{p+1}\ldots\leftarrow \un{Y}y_{p+1}\ldots$ for search paths that do not have the pointer reach the symbol $y_{p+1}$. For these cases, the RHS involves the forward computation $\un{\alpha} Xz_{p+1}\ldots\to Zz_{p+1}\ldots\to Q\ldots$ and the origin is $\un{Y}y_{p+1}\ldots$ therefore
$F\left(I\text{ context }(y_{p+1},z_{p+1})\right)\supseteq F(I)\text{ context }(y_{p+1},z_{p+1})$. Extra results could only come from backward search paths that do have the pointer reach a symbol in $y_{p+1}$ and have an eventual origin with the pointer at the left. These are denoted by $F^*(I+(y_{p+1},z_{p+1}))$.

If $I$ is not of extendable type, the result is trivially true because $F(I)=\emptyset$ and the conditions determining the new origin are the same.
\end{proof}
\end{Theorem}
\end{comment}

\section{Outline of a possible algorithm for TM analysis}
Looking at the many examples of IGR's here including those in the next section suggests the best practical method to analyse the TM is to repeatedly apply $F$ to results that generate the IRR(3). 

A typical instance involves applying $F$ to IRR outline X as follows:

\begin{alg}\label{algorithm9.1}[Algorithm for applying $F$ to an IRR outline $X$] Repeat while $X$ has not already had $F$ applied to it \{Truncate $X$ by 1 symbol putting the context pair at the end of a sequence or list that starts empty\}. Apply $F$ to $X$ truncated to length 1 as in the examples above or to the last but one result of this loop by applying the last context pair in the list to each member of $X$ that is not extendable as its LHS as described in Table~\ref{Table3} and Section~\ref{section7}. Repeat this recursively, unless already done, for any member of $X$ that is not extendable using the next context pair. Repeat till all the context has been applied. If the result of applying $F$ is no new results, this terminates this branch of the calculation. The procedure branches whenever there is more than one $X$ that is of non-extendable type (case 4). The must be a separate pointer to the list of contexts for each branch.

The intermediate results of this procedure may not be needed in the final analysis. They should be marked as such so that $F$ will not be applied to them at the next stage to generate IGR's for determining the $IRR(n)$. 
\end{alg}
\begin{Theorem}Algorithm~\ref{algorithm9.1} applied to an IRR outline $X$ generates all the IGRs that define all the results of the application of $F$ to $X$ as described in Section~\ref{section4}.
\end{Theorem}
\begin{proof}
(Sketch) This is obvious because truncating $X$ truncates both the forward computation and backward search to that length and these calculations must be included in the full calculation for the original $X$. Therefore adding back the effect of the symbols truncated off systematically so that no options are forgotten must give the same result. This holds separately for each individual backward search path and forward computation possible.
\end{proof}
Note that in this algorithm it is the non-extendable IRR outlines on the RHS that can have extra contexts applied to generate new IGR members. If the IRR outlines of the right are extendable they can have $F$ applied using a new $\alpha$ to generate new IGR members.

Repeat this starting with each IRR outline generated from the TM until $F$ has been applied to every IRR outline generated. All the IGR's so obtained must be recorded including those that lead to no new IRR outlines.

This may terminate because the final result is the IGR used to extend $X$ which can often be expected to be much shorter than $X$. See the example in Section~\ref{section4}. I will shortly try to construct a computer program to do this and check against the results obtained so far.

A result of the analysis for a TM will be that each IRR outline has associated with it a set of pairs of context strings that generate the IRR's it corresponds to. 
%{c|l@{\hspace{0.5em}}l|c|l@{\hspace{0.5em}}l}
%set&\multicolumn{2}{c|}{IRR($n$)}&$\alpha$&\multicolumn{2}{c}{IRR($n+1$)}\\
%number&Origin&RHS&&Origin&RHS\\

\section{\label{section7}A few detailed examples}
Example 9 is using up-to-date methods look at this first
For example (1) the third member of the RHS of \eqref{set26.3} i.e. $2\un{c}\beta\ldots\to\to 5\_cc\ldots\text{ for }\beta\in\{d,e\}$ is a subset of the \eqref{irr2rllr}.4 i.e. $2\un{c}\ldots\to\to 5\_c\ldots$ therefore the application of $F$ to the latter which has already been done is included in the application of $F$ to the former. To see this note the following, where every step is shown  
\begin{equation}\label{eq132}2\alpha\un{c}d\ldots\leftarrow \left\{\begin{array}{l}1\alpha c\un{a}\ldots\leftarrow 2\alpha\un{a}a\ldots\left\{\begin{array}{l}\stackrel{\alpha =b}{\leftarrow}\left\{\begin{array}{l}1\un{d}aa\ldots\\1\un{e}aa\ldots\end{array}\right.\\
\leftarrow 3\alpha a\un{c}\ldots\leftarrow\left\{\begin{array}{l}5\alpha\un{c}c\ldots\stackrel{\alpha = a}{\leftarrow}4\un{e}cc\ldots\\5\alpha\un{e}c\ldots\stackrel{\alpha = a}{\leftarrow} 4\un{e}ec\ldots\\\end{array}\right.\end{array}\right.\\
\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}cd\ldots\\1\un{e}cd\ldots\end{array}\right.\\\end{array}\right.
\end{equation}
and \begin{equation}\label{eq133}2\alpha\un{c}e\ldots\left\{\begin{array}{l}\leftarrow 5\alpha c\un{a}\ldots\leftarrow\emptyset\\\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}ce\ldots\\1\un{e}ce\ldots\end{array}\right.\end{array}\right..\end{equation}

The bottom two branches in \eqref{eq132} and \eqref{eq133} can be deduced from \eqref{irr2rllr}.4 so these do not need to be repeated, and the remainder can be summarised as follows
\begin{equation}\label{eq134}2\alpha\un{c}d\ldots\left\{\begin{array}{l}\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}aa\ldots\\1\un{e}aa\ldots\end{array}\right.\\
\stackrel{\alpha = a}{\leftarrow}\left\{\begin{array}{l}4\un{e}cc\ldots\\4\un{e}ec\ldots\end{array}\right.\end{array}\right.\end{equation} because the branch ending in $5\alpha c\un{a}\ldots$ represents a case where the backward search ends because $5c\_$ cannot be arrived at from any TM configuration (see \eqref{rev1}) and the reachability of the LHS is not established so it cannot generate an IRR.
After combining \eqref{eq134} with the development of the RHS's this gives the result
\begin{equation}2\un{c}\beta\ldots\to\to5\_cc\ldots\text{ for }\beta\in\{d,e\}\Rightarrow\left\{\begin{array}{l}\left.\begin{array}{l}4\un{e}cc\ldots\\4\un{e}ec\ldots\end{array}\right\}\to\to 2\_ecc\ldots\\
\left.\begin{array}{l}1\un{d}aa\ldots\\1\un{e}aa\ldots\end{array}\right\}\to\to 3\_ecc\ldots\end{array}\right.\end{equation}
additional to \eqref{107} with contexts $(d,c)$ and $(e,c)$, which when written out in full are
\begin{equation}2\un{c}d\ldots\to\to5\_cc\ldots\Rightarrow \left.\begin{array}{l}1\un{d}cd\ldots\\1\un{e}cd\ldots\end{array}\right\}\to\to3\_ecc\ldots\end{equation} and
\begin{equation}2\un{c}e\ldots\to\to5\_cc\ldots\Rightarrow \left.\begin{array}{l}1\un{d}ce\ldots\\1\un{e}ce\ldots\end{array}\right\}\to\to3\_ecc\ldots.\end{equation}

As another example (2) consider the right hand member of \eqref{107} which gives rise to the following under $F$:
\begin{equation}\label{107f}1\un{\gamma}c\ldots\to\to 3\_ec\ldots\Rightarrow\left\{\begin{array}{l}2\un{d}\gamma c\ldots\to\to3caa\ldots\\
2\un{a}\gamma c\ldots\to\to 2\_aec\ldots\\
2\un{c}\gamma c\ldots\to\to5\_cec\ldots\end{array}\right.\text{ for }\gamma\in\{d,e\}\end{equation}
In this case the symbol $c$ is never reached during the backward search to find new origins and therefore it makes sense to record instead the more general and brief statement of the IGR given that the RHS can be found using just $r=2$ symbols, and note the context which is the pair of strings of symbols omitted. The context needs to be specified because it could be involved in the computation of the IGRs giving the IRR's for the next value of $n$ (5). This gives
\begin{equation}\label{107fs}1\un{\gamma}\ldots\to\to 3\_e\ldots\Rightarrow\left\{\begin{array}{l}2\un{a}\gamma\ldots \to\to2\_ae\ldots\\2\un{c}\gamma\ldots\to\to5\_ce\ldots\end{array}\right.\text{ for }\gamma\in\{d,e\}\text{ context }(c,c)\end{equation} because it has not already been done above, and the third result derived above must be given in full:
\begin{equation}1\un{\gamma} c\ldots\to\to 3\_ec\ldots\Rightarrow 2\un{d}\gamma c\ldots\to\to 3caa\ldots.\end{equation} 
Consider another example (3) \begin{equation}\label{eq138}3\ldots b\un{c}\to\to1\ldots bc\_.\end{equation} Searching for new origins leads to
\begin{equation}\label{eq139}3\ldots b\un{c}\alpha\left\{\begin{array}{l}\stackrel{\alpha = a}{\leftarrow}1\ldots bc\un{c}\\
\stackrel{\alpha = b}{\leftarrow} 4\ldots bc\un{a}\\
\stackrel{\alpha = c}{\leftarrow} 2\ldots bc\un{e}\\
\stackrel{\alpha = e}{\leftarrow} 5\ldots bc\un{b}\\
\leftarrow 3\ldots\un{e}c\alpha\leftarrow 2\ldots e\un{e}\alpha\left\{\begin{array}{l}
\stackrel{\alpha = a}{\leftarrow}3\ldots ee\un{c}\\
\stackrel{\alpha = d}{\leftarrow}1\ldots ee\un{a}\\
\stackrel{\alpha = e}{\leftarrow}5\ldots ee\un{a}\end{array}\right.\end{array}\right..\end{equation}
Because there is no IGR already with left member $3\ldots \un{c}\to\to1\ldots c\_$, all the results from \eqref{eq139} must be taken into account (otherwise first the 4 branches of the backward search with $\alpha\in\{a,b,c,e\}$ would not have to be done again). Three of these do not involve the symbol $b$ in the backward search and after completing the RHS's shows that $r=2$ so they can be written as
\begin{equation}3\ldots \un{c}\to\to1\ldots c\_\Rightarrow \left\{\begin{array}{l}1\ldots c\un{c}\to\to 2\ldots db\_\\
4\ldots c\un{a}\to\to2\ldots db\_\\
5\ldots c\un{b}\to\to2\ldots cb\_\end{array}\right.\text{ context }(b,b).\end{equation} The remaining branches give the additional results
\begin{equation}3\ldots b\un{c}\to\to 1\ldots bc\_\Rightarrow\left\{\begin{array}{l}
2\ldots bc\un{e}\to\to 4\ldots caa\\
3\ldots ee\un{c}\to\to 2\ldots bdb\_\\
1\ldots ee\un{a}\to\to 2\ldots bcb\_\\
5\ldots ee\un{a}\to\to 2\ldots bcb\_\end{array}\right..\end{equation}

Another example (4):
start with $5\ldots d\un{d}\to\to1\ldots bc\_$. The analysis for $5\ldots \un{d}\to\to 1\ldots c\_$ has not been done, so both directions need to be considered initially in the start of the backward search. Only going towards the $\alpha$ gives any results which are new origins $3\ldots dd\un{d}$ and $4\ldots dd\un{d}$ and these only for $\alpha = c$. The RHS gives $1bc\un{c}\to 4\_caa$ in 3 steps. Computing the RHS used all 3 positions of the pointer , so $r=3$ and they will all be displayed in the result which I write as
\begin{equation}5\ldots d\un{d}\to\to1\ldots bc\_\Rightarrow \left.\begin{array}{l}3\ldots dd\un{d}\\4\ldots dd\un{d}\end{array}\right\}\to\to4\ldots caa.\end{equation}
Another example(5):
starting with $3\ldots d\un{b}\to\to1\ldots bd\_$, note that the IGR starting with $3\ldots \un{b}\to\to 1\ldots d\_$ has not been done. So considering all cases starting the backward search gives
\begin{equation}3\ldots d\un{b}\alpha\leftarrow \left\{\begin{array}{l}
\stackrel{\alpha = a}{\leftarrow}1\ldots db\un{c}\\
\stackrel{\alpha = b}{\leftarrow}4\ldots db\un{a}\\
\stackrel{\alpha = c}{\leftarrow}2\ldots db\un{e}\\
\stackrel{\alpha = e}{\leftarrow}5\ldots db\un{b}\\
\end{array}\right.\end{equation} and the forward computation of the RHS's shows that for $\alpha\in\{b,c\}$ all 3 symbol positions on the right are passed by the pointer, and for $\alpha = a$, 2 symbol positions are used, and for $\alpha = e$ only 1 position is used. Therefore the 4 results are written with the minimum number of symbols as follows
\begin{equation}
3\ldots\un{b}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}1\ldots b\un{c}\to\to 2\ldots ab\_\\
5\ldots b\un{b}\to\to2\ldots db\_\end{array}\right.\text{ context }(d,b)\end{equation}
\begin{equation}3\ldots d\un{b}\to\to 1\ldots bd\_\Rightarrow\left\{\begin{array}{l}4\ldots db\un{a}\to\to3\ldots ecd\\2\ldots db\un{e}\to\to 3\ldots eca\end{array}\right..\end{equation}
Example (6): $2\un{d}d\ldots\to\to 3\_bc\ldots$ with context $(e,c)$.
Ignoring the context for now, the backward search gives the following showing every step:
\begin{equation}2\alpha\un{d}d\ldots\left\{\begin{array}{l}\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}dd\ldots\\1\un{e}dd\ldots\end{array}\right.\\
\leftarrow 1\alpha d\un{a}\ldots\leftarrow 2\alpha \un{c}a\ldots\left\{\begin{array}{l}\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}ca\ldots\\1\un{e}ca\ldots\end{array}\right.\\
\leftarrow 3\alpha c\un{c}\ldots\leftarrow 4\alpha\un{c}c\ldots\left\{\begin{array}{l}2\alpha c\un{b}\ldots\\3\alpha c\un{b}\ldots\leftarrow 4\alpha\un{c}b\ldots\left\{\begin{array}{l}\stackrel{\alpha = b}{\leftarrow}4\un{b}cb\ldots\\\stackrel{\alpha = c}{\leftarrow} 3\un{a}cb\ldots\end{array}\right.\\
\stackrel{\alpha = b}{\leftarrow} 4\un{b}cc\ldots\\\stackrel{\alpha = c}{\leftarrow} 3\un{a}cc\ldots\end{array}\right.\end{array}\right.\end{array}\right.\end{equation}
The effect of adding the context is to allow the possibility of more backward searches from where the pointer reaches the symbol next to $\ldots$. This gives
\begin{equation}\begin{array}{l}1\alpha d\un{a}e\ldots\leftarrow\emptyset\\3\alpha c\un{c}e\ldots\leftarrow 5\alpha cc\un{b}\ldots\leftarrow\emptyset\\
2\alpha c\un{b}e\ldots\leftarrow\emptyset\\3\alpha c\un{b}e\ldots\leftarrow 5\alpha cb\un{b}\ldots\leftarrow\emptyset\end{array}\end{equation}
Because there are no extra origins the result can be summarised as
\begin{equation}2\un{d}d\ldots\to\to 3\_bc\ldots\Rightarrow\left\{\begin{array}{l}\left.\begin{array}{l}1\un{d}dd\ldots\\1\un{e}dd\ldots\\1\un{d}ca\ldots\\1\un{e}ca\ldots\\4\un{b}cc\ldots\\4\un{b}cb\ldots\end{array}\right\}\to\to 4\_cbc\ldots\\\left.\begin{array}{l}3\un{a}cc\ldots\\3\un{a}cb\ldots\end{array}\right\}\to\to 2\_abc\ldots\end{array}\right.\text{ context }(e,c)\end{equation} and further written in terms of earlier results as
\begin{equation}\eqref{set29.4}\text{ context } (e,c)\end{equation}
and \begin{equation}\label{2context}\eqref{set4.3}\text{ context }(d,c)\text{ context }(e,c).\end{equation} Because the contexts are written on the right (where the $\ldots$ are) in \eqref{2context} the contexts can be combined to give\begin{equation}\eqref{set4.3}\text{ context }(de,cc).\end{equation} otherwise they would have been combined in reverse order.

Example (7): consider $X=2\un{c}e\ldots\to\to 5\_cc\ldots$ with context $(e,c)$.
Remove the rightmost symbols to get $Y=2\un{c}\ldots\to\to 5\_c\ldots$. $F$ has been applied to $Y$ giving results \eqref{107.3} that generate only extendable IRR's therefore contextual symbols can be added generating results of the same type in this case from $X$, $F$ gives \eqref{107.3} with context $(e,c)$, to which an extra context $(e,c)$ is needed. In addition, results can possibly be found starting the backward search from $2\alpha \un{c}e\ldots$ where the first backward step is to the right giving $2\alpha\un{c}e\ldots\leftarrow5\alpha c\un{a}\ldots\leftarrow\emptyset$ giving no new origins. Adding the final context symbol and continuing the backward search gives $5\alpha c\un{a}e\ldots\leftarrow\emptyset$ so $F$ applied to $X\text{ context }(e,c)$ gives only \eqref{107.3} with context $(ee,cc)$.

Example (8): consider $X=1\un{d}a\ldots\to\to 4\_ca\ldots$ with context $(c,a)$. Removing the rightmost symbols gives $Y=1\un{d}\ldots\to\to 4\_c\ldots$ which has been done in \eqref{set26.3} giving 3 results, one generating non-extendable IRR's, but $X$ has not been done. Doing it now (applying $F$ to $X$) starts with the backward search $1\alpha\un{d}a\ldots\leftarrow\emptyset$, but in addition there is the result of adding the context symbols $(a,a)$ back to the result of applying $F$ to $Y$ giving (using $2ab\un{a}\to 1abc\_$)
\begin{equation}1\un{d}a\ldots\to\to 4\_ca\ldots\Rightarrow\left\{\begin{array}{l}2\un{d}da\ldots\to\to 3\_bca\ldots\\
2\un{a}da\ldots\to\to 1abc\ldots\\2\un{c}da\ldots\to\to 5\_cca\ldots\end{array}\right.\end{equation}
which is probably better expressed by the two equations following:
\begin{equation}\label{ex1}1\un{d}\ldots\to\to 4\_c\ldots\Rightarrow\left\{\begin{array}{l}2\un{d}d\ldots\to\to 3\_bc\ldots\\
2\un{c}d\ldots\to\to 5\_cc\ldots\end{array}\right.\end{equation} with context $(a,a)$
and \begin{equation}1\un{d}a\ldots\to\to 4\_ca\ldots\Rightarrow 2\un{a}da\ldots\to\to 1abc\ldots\end{equation}
Now including the additional context $(c,a)$ under $F$ gives
\begin{equation}\eqref{ex1}\text{ context }(ac,aa)\end{equation} and (using $1abc\un{a}\to 2abdb\_$)
\begin{equation}1\un{d}ac\ldots\to\to 4\_caa\ldots\Rightarrow 2\un{a}dac\ldots\to\to 2abdb\ldots\end{equation}

Example (9):

 $EX()$ is the function that picks out the extendable subset of an IGR.
 Apply $F$ to the RHS's of $\eqref{set7.3}$ with context $(d,c)$. Consider first
\begin{equation}F\left(\left\{\begin{array}{l}5\un{c}e\ldots\\5\un{e}e\ldots\end{array}\right\}\to\to 5ca\ldots+(d,c)\right)=\emptyset\end{equation} using Theorem~\ref{thm4.2} because \begin{equation}F\left(\left\{\begin{array}{l}5\un{c}e\ldots\\5\un{e}e\ldots\end{array}\right\}\to\to 5ca\ldots\right)=\emptyset\end{equation} and
$5\alpha\un{c}e\ldots\leftarrow\emptyset$ and $5\alpha\un{e}e\ldots\leftarrow\emptyset,$ where the first backward step is restricted to being to the right in each case.

Next consider $F(3\un{e}e\ldots\to\to 4\_ce\ldots +(d,c))=F(LHS\eqref{set6.3}+(ed,ec))$
$=RHS\eqref{set6.3}+(ed,ec)$ using Theorem~\ref{thm4.2} and the fact that
$3\alpha\un{e}ed\ldots\leftarrow 5\alpha e\un{b}d\ldots\leftarrow\emptyset$ where the backward search path with the pointer moving to the left at the first reverse step was omitted because the pointer there does not reach the string $p$ which is $ed$. This is the same as
\begin{equation}\label{ex9.4}\text{RHS's of }\eqref{set6.3} \text{ context }(e,e)\text{ context }(d,c).\end{equation}
The cases of this with the pointer moving unexpectedly (the others are trivial to write down) are $3\un{e}e\ldots\to\to 3bc\ldots$ and $4\un{c}e\ldots\to\to 2ab\ldots$ to which first context $(e,e)$ is applied, then $(d,c)$. The first stage gives \begin{equation}\label{ex9.1}3\un{e}ee\ldots\to\to 3bcb\ldots\end{equation} using $3bc\un{e}\ldots\to 3bcb\ldots$ and\begin{equation}\label{ex9.2}4\un{c}ee\ldots\to\to 3\_bcc\ldots\end{equation} respectively (using $2ab\un{e}\ldots\to 3\_bcc\ldots$ from \eqref{irr3.45_2}) , and applying $(d,c)$ to the first of these gives \begin{equation}\label{ex9.3}3\un{e}eed\ldots\to\to 1babc\ldots\end{equation} (using $3bcb\un{c}\ldots\to 1babc\ldots$ from $\eqref{irr3.52_3}$).
Therefore the IGR's giving these results in general form expressed with the minimum number of symbols are 
$EX\eqref{set6.3}\text{ context }(ed,ec)$, $EX\eqref{set1.4}\text{ context }(d,c)$, and $3\un{e}ed\ldots\to\to 4\_cec\ldots\Rightarrow 3\un{e}eed\ldots\to\to 1babc\ldots$, which can be written more explicitly as \begin{equation}\left\{\begin{array}{l}3\un{e}\ldots\to\to4\_c\ldots\Rightarrow\left.\begin{array}{l}5\un{c}e\ldots\\5\un{e}e\ldots\end{array}\right\}\to\to 3\_bc\ldots \text{ context }(ed,ec)\\
3\un{e}ed\ldots\to\to 4\_cec\ldots\Rightarrow 3\un{e}eed\ldots\to\to 1babc\ldots\\
3\un{e}e\ldots\to\to4\_ce\ldots\Rightarrow 4\un{c}ee\ldots\to\to 3\_bcc\ldots \text{ context }(d,c)\end{array}\right..\end{equation}
This form is most useful because for example in the last line the pointer does not reach the rightmost symbol (in the context) in its derivation, which is more informative than just $3\un{e}ed\ldots\to\to 4\_cec\ldots\Rightarrow 4\un{c}eed\ldots\to\to 3\_bccc\ldots$ in which the pointer could apparently have reached the last symbol if the derivation was not known.

Next consider  $F(4\un{c}e\ldots\to\to 2\_ae\ldots$ + $(d,c))$ gives just \begin{equation}\label{ex9.5}\eqref{set30.4}\text{ context }(ed,ec)\end{equation} because $4\alpha\un{c}ed\ldots\leftarrow\emptyset$ under the condition that the first backward TM step in the backward search is to the right.

Example 10.

From the first RHS of \eqref{set26.3} i.e. $2\un{d}d\ldots\to\to 3\_bc\ldots\text{ context }(e,c)$, writing this out in full and applying $F$ leads to a set of results that can be classified by $r_1$ and $r_2$. They can then be written without any redundant symbols and the use of contexts as follows:
\begin{equation}2\un{d}\ldots\to\to 3\_b\ldots\Rightarrow \left.\begin{array}{l}1\un{d}d\ldots\\1\un{e}d\ldots\end{array}\right\}\to\to 4\_cb\ldots\text{ context }(de,cc)\end{equation}
\begin{equation}2\un{d}d\ldots\to\to 3\_bc\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}1\un{d}ca\ldots\\1\un{e}ca\ldots\\4\un{b}ca\ldots\\4\un{b}cb\ldots\end{array}\right\}\to\to 4\_cbc\\
\left.\begin{array}{l}3\un{a}cc\ldots\\3\un{a}cb\ldots\end{array}\right\}\to\to 2\_abc\ldots\end{array}\right.\text{ context }(e,c).\end{equation}
These were obtained from the backward search starting from $2\alpha\un{d}de\ldots$ giving 8 results which had respectively two with $r_1=2$, four with $r_1=3$ each with $\alpha=b$, and the last two with $\alpha=c$ and $r_1=3$.

 so for example in deriving
\begin{equation}4\un{c}e\ldots\to\to2\_ae\ldots\Rightarrow 3\un{a}ce\ldots\to\to3\_bcc\ldots\end{equation}
the first reverse move of the pointer is towards the $\alpha$ indicating that it should be derived from the IGR with the rightmost symbols removed (which involves the backward search starting by moving towards the $\alpha$) \begin{equation}4\un{c}\ldots\to\to 2\_a\ldots\Rightarrow 3\un{a}c\ldots\to\to 2ab\ldots\end{equation}
followed by putting the symbol on the right back giving $2ab\un{e}\ldots\to 3\_bcc\ldots$.
 The method in example 10 could be carried out for all the other results, but it would likely be very slow and inefficient. Note that $2\un{d}\ldots\to\to 3\_b\ldots$ has already had $F$ done to it. 
\begin{equation}5\ldots dc\un{b}\to\to 1\ldots abd\_\end{equation} needs to have $F$ applied to it. In this case not even $5\ldots\un{b}\to\to 1\ldots d\_$ has yet had $F$ applied to it, so this is done next giving\begin{equation}5\ldots\un{b}\to\to 1\ldots d\_\Rightarrow\left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to 5\ldots ca.\end{equation} Applying the context $(c,b)$ gives no backward search paths that take the pointer to the $c$ so we just get
\begin{equation}5\ldots c\un{b}\to\to 1\ldots bd\_\Rightarrow\left.\begin{array}{l}3\ldots cb\un{d}\\4\ldots cb\un{d}\end{array}\right\}\to\to 3\ldots eca.\end{equation} This would not have to be written down ($r_1 = 2$) if it wasn't for the fact that on the right the pointer again ends up at the left (within the $\ldots$) and in fact $r_2 = 3$ giving $r=3$. This illustrates the fact that the result needs to be written if and only if $r>p$ (otherwise it is just a trivial extension of a previous IRR outline).
Now applying the final context $(d,a)$ gives \begin{equation}5\ldots dc\un{b}\to\to 1\ldots abd\_\Rightarrow \left.\begin{array}{l}3\ldots dcb\un{d}\\4\ldots dcb\un{d}\end{array}\right\}\to\to 4\ldots caac\_.\end{equation} Here $r_1=2$ and $r_2=4$.

Example 12

$F$ needs to be applied to $5\ldots aa\un{d}\to\to 3\ldots abc\_$, and it has not already been applied to $5\ldots a\un{d}\to\to 3\ldots bc\_$ nor to $5\ldots \un{d}\to\to 3\ldots c\_$, so the context pairs $(a,a)$ and $(a,b)$ removed in these steps will be kept for later.
Now $5\ldots\un{d}\to\to 3\ldots c\_$ needs to have $F$ applied to it. This gives \begin{equation}5\ldots\un{d}\to\to 3\ldots c\_\Rightarrow \left.\begin{array}{l}3\ldots d\un{d}\\4\ldots d\un{d}\end{array}\right\}\to\to 2\ldots ab\_.\end{equation}
Applying the context $(a,b)$ gives, apart from the trivial result which leads to the above with context $(a,b)$ applied, the alternative origin $4\ldots\un{e}d\alpha$ because on the left the backward search starting from $5\ldots a\un{d}\alpha\leftarrow 4\ldots\un{e}d\alpha\leftarrow 1\ldots e\un{b}\alpha\leftarrow\emptyset.$
Next applying the remaining context $(a,a)$ gives no non-trivial results because
$4\ldots a\un{e}d\alpha\leftarrow 1\ldots ae\un{b}\alpha\leftarrow\emptyset.$ and it is unnecessary to compute the RHS.

Example 13

Again for applying $F$ to $3\ldots eb\un{d}\to\to 4\ldots bcc\_$, $F$ has not already been applied to it or either of its shortened forms by deleting symbols from the left. Starting from
\begin{equation}\label{ex13_1}3\ldots\un{d}\to\to 4\ldots c\_\Rightarrow\left\{\begin{array}{l}
a:1\ldots d\un{c}\to\to 2\ldots ab\\b:4\ldots d\un{a}\to\to 4\ldots cb\_\\c:2\ldots d\un{e}\to\to 3\ldots cc\_\\e:5\ldots d\un{b}\to\to 5\ldots ca\_\end{array}\right.\end{equation} only the first of these results is non-extendable by $F$ and leading to possibly non-trivial results of putting back 1 pair of context symbols. The next paragraph shows why the $\alpha$ values are in general needed.

Adding back the context $(b,c)$ gives $3\ldots b\un{d}\to\to 4\ldots cc\_$ on the LHS, and the backward search for each value of $\alpha$ i.e. $\alpha\in\{a,b,c,e\}$ starts from $3\ldots b\un{d}\alpha$ giving one branch as \begin{equation}3\ldots b\un{d}\alpha\leftarrow 3\ldots \un{e}d\alpha\leftarrow\emptyset\end{equation} therefore $3\ldots\un{e}d\alpha$ is a new alternative origin that needs to be recorded because if another symbol is added by the $\ldots$, the backward search could possibly continue. The only other branches of the backward search are single steps to the right analogous to what was done to get \eqref{ex13_1} and generate results with $r_1=2$. On the right only for $\alpha = a$ is the new RHS non-trivial because $2\ldots \un{c}ab\to 3\ldots abc\_$ giving $r_2=3$, with the other cases having $r_2=2$. For each value of $\alpha$ there is thus a set of origins possible and an RHS, determining $r_1,r_2$ and $r=\text{max}(r_1,r_2)$ in each case. If $r=2$ the effect of the addition of the context is just to add the context symbols on the LHS and and RHS of the $\to\to$ respectively, on both sides of the $\Rightarrow$ and will not be recorded, therefore the only results recorded are either from the alternative origin (that applies to all values of $\alpha$), or from the case $\alpha = a$ which is non-extendable by $F$ and has the pointer position not shown in the RHS. The $\alpha$ value could be needed in another extension by a context because that value will have to be added on the right to get a new RHS. Therefore I write the result as
\begin{equation}\label{ex13_2}3\ldots b\un{d}\to\to 4\ldots cc\_\Rightarrow a: 1\ldots bd\un{c}\to\to 3\ldots abc\_,\{3\ldots \un{e}da\}\end{equation}

The last context to be applied is $(e,b)$. Adding the context symbol to the alternative origin and start the backward search from there gives $3\ldots e\un{e}da\leftarrow\emptyset$. Therefore the final result is
\begin{equation}3\ldots eb\un{d}\to\to 4\ldots bcc\_\Rightarrow\emptyset,\emptyset\end{equation}
other than the trivial extension of \eqref{ex13_2} by the context which adds nothing new.

Example 14

Consider applying the context $(e,c)$ to \eqref{set28.4} to generate the RHS of $2\un{c}de\ldots\to\to 5\_ccc\ldots\Rightarrow$. I chose this example because this at first sight seems very complex and it illustrates many concepts.

Firstly it is of course possible to carry out this calculation according to the method described in Section~\ref{section4}. But doing so will inevitably repeat much of what was done in the derivation of \eqref{set28.4} with an extra symbol added. Hence the motivation for the short cut method described in Section~\ref{section5}.

The first step is to add in the context symbol $e$ to the alternative origins and start the backward search from each case. The initial backward step must be restricted(R) to going to the added symbol which happens to be on the right here but could be to the left in other examples. This is indicated by $\stackrel{R}{\leftarrow}$ and avoids repetition from earlier calculations. These give the extra results from adding the extra symbol $e$ thus
\begin{equation}\begin{array}{l}
1\alpha c\un{a}e\ldots\stackrel{R}{\leftarrow}\emptyset\\
1\alpha c\un{b}e\ldots\stackrel{R}{\leftarrow}\emptyset\\
3\alpha a\un{c}e\ldots\stackrel{R}{\leftarrow}5\alpha ac\un{b}\ldots\leftarrow\emptyset\\
3\alpha c\un{d}e\ldots\stackrel{R}{\leftarrow}5\alpha cd\un{b}\ldots\leftarrow\emptyset\\
4\alpha c\un{d}e\ldots\stackrel{R}{\leftarrow}\emptyset\\
3\alpha e\un{d}e\ldots\stackrel{R}{\leftarrow}5\alpha ed\un{b}\ldots\leftarrow\emptyset\\
4\alpha e\un{d}e\ldots\stackrel{R}{\leftarrow}\emptyset\end{array}\end{equation}
This establishes the new alternative origins as $\{5\alpha ac\un{b}\ldots,5\alpha cd\un{b}\ldots,5\alpha ed\un{b}\ldots\}$ and shows that there are no new regular origins.

The results must be obtained separately for each value of $\alpha\in\{a,b,c\}$ involved in \eqref{set28.4}, and recall that $r=\text{max}(r_1,r_2)=4$ is a necessary condition for a result to be recorded, otherwise it is a trivial extension of an IGR for $r\le 3$ obtained by adding the context $(e,c)$ to \eqref{set28.4}. For $\alpha\in\{a,b\}$, the RHS's with the symbol $c$ added are $2\_eccc\ldots$ and $3\_eccc\ldots$ for $\alpha = a,b$ respectively. These RHS's are trivially obtained and have no TM steps $r_2$ should be defined as 0. Also there are no new regular origins above that would have had $r_1=4$ because the pointer would have passed all four places in the string to end up at position 0, therefore in these cases $r<4$ giving nothing non-trivial. For $\alpha = c$ the RHS is obtained from $1dbd\un{c}\ldots\to 5\_ceca\ldots$ giving $r_2=r=4$ therefore all the origins for this case must be worked out which are trivially $3\un{a}cde\ldots$ and $4\un{c}ade\ldots$ by just adding in the symbol $e$ on the right. The alternative origins must also be included giving finally
\begin{equation}2\un{c}de\ldots\to\to 5\_ccc\ldots\Rightarrow c:\left.\begin{array}{l}3\un{a}cde\ldots\\4\un{c}ade\ldots\end{array}\right\}\to\to 5\_ceca\ldots,\left\{\begin{array}{l}5cac\un{b}\ldots\\5ccd\un{b}\ldots\\5ced\un{b}\ldots\end{array}\right\}\end{equation}

Example 15

Consider the case \eqref{224}. Adding the extra symbol to the alternative origin and tracing back gives
\begin{equation}4\alpha a\un{a}c\ldots\stackrel{R}{\leftarrow}\left\{\begin{array}{l}2\alpha aa\un{b}\ldots\leftarrow\emptyset\\
3\alpha aa\un{b}\ldots\leftarrow\left\{\begin{array}{l}5\alpha a\un{c}b\ldots\leftarrow 4\alpha\un{e}cb\ldots\left\{\begin{array}{l}\leftarrow 2\alpha e\un{b}b\ldots\leftarrow\emptyset\\
\leftarrow 3\alpha e\un{b}b\ldots\leftarrow\emptyset\\
\stackrel{\alpha = b}{\leftarrow} 4\un{b}ecb\ldots\\
\stackrel{\alpha = c}{\leftarrow}3\un{a}ecb\ldots\end{array}\right.\\
5\alpha a\un{e}b\ldots\leftarrow 4\alpha\un{e}eb\ldots\left\{\begin{array}{l}
\stackrel{\alpha = b}{\leftarrow}4\un{b}eeb\ldots\\
\stackrel{\alpha = c}{\leftarrow}3\un{a}eeb\ldots\end{array}\right.\end{array}\right.\end{array}\right.\end{equation}
This gives two origins for each of $\alpha\in\{b,c\}$ and two new alternative origins. The RHS's for $\alpha\in\{a,c\}$ give $r_2=0$. Therefore $r=4$ for $\alpha\in\{b,c\}$ only and the results are
\begin{equation}3\un{a}bd\ldots\to\to 2\_aec\ldots\Rightarrow\left\{\begin{array}{l}
b:\left.\begin{array}{l}4\un{b}ecb\ldots\\4\un{b}eeb\ldots\end{array}\right\}\to\to 4\_caec\ldots,\left\{\begin{array}{l}2baa\un{b}\ldots\\3baa\un{b}\ldots\end{array}\right\}\\
c:\left.\begin{array}{l}3\un{a}ecb\ldots\\3\un{a}eeb\ldots\\4\un{c}abd\ldots\end{array}\right\}\to\to 2\_abcc\ldots,\left\{\begin{array}{l}2caa\un{b}\ldots\\3caa\un{b}\ldots\end{array}\right\}\end{array}\right.\end{equation}
\section{\label{section8}Generating the IRR}
\subsection{The list of results of the IRR(2)}
The IRR(2) i.e. equation~\eqref{irr2} were segregated into the 3 categories, those of type RR \eqref{irr2rr}, type LL \eqref{irr2ll}, which are non-extendable and are expressed unabbreviated and types RL and LR that are extendable and are abbreviated \eqref{irr2rllr}.
\begin{equation}\label{irr2rr}\begin{tabular}{llll}
$1\un{d}b\to\to 3bc\_$&$1\un{e}b\to\to 3bc\_$&$2\un{a}a\to\to 2db\_$&$2\un{a}b\to\to 2db\_$\\
$2\un{d}a\to\to 2cb\_$&$3\un{a}d\to\to 2db\_$&$3\un{e}b\to\to 3bc\_$&$2\un{c}a\to\to 2ab\_$\\
$4\un{e}a\to\to 2cb\_$&$4\un{e}b\to\to 5ca\_$&$4\un{c}b\to\to 2ab\_$&$4\un{c}d\to\to 2db\_$\\
$5\un{e}c\to\to 2ab\_$ &$4\un{c}c\to\to 2ab\_$&$5\un{c}c\to\to2db\_$&$5\un{e}c\to\to 2db\_$\\
\end{tabular}\end{equation}
\begin{equation}\label{irr2ll}\begin{tabular}{llll}
$1a\un{c}\to\to2\_ab$&$2e\un{e}\to\to4\_ca$&$5b\un{d}\to\to4\_cb$&$1b\un{b}\to\to 3\_ec$\\
$1e\un{b}\to\to3\_ba$\\
\end{tabular}\end{equation}
\begin{equation}\label{irr2rllr}\begin{tabular}{llll}
$1\un{d}\ldots\to\to 4\_c\ldots$&$\text{ context }(e,c)$&$1\un{e}\ldots\to\to4\_c\ldots$&$\text{ context }(e,c)$\\$2\un{a}\ldots\to\to2\_a\ldots$&$\text{ context }(c,a)$&$2\un{c}\ldots\to\to 5\_c\ldots$&$\text{ context }\begin{array}{l}(b,d)\\(c,a)\end{array}$\\
$2\un{d}\ldots\to\to 2\_a\ldots$&$\text{ context }(c,b)$&$2\un{d}\ldots\to\to 3\_b\ldots$&$\text{ context }(b,d)$\\
$3\un{a}\ldots\to\to 2\_a\ldots$&$\text{ context }(a,b)$&$3\un{e}\ldots\to\to 3\_e\ldots$&$\text{ context }(d,c)$\\
$3\un{e}\ldots\to\to 4\_c\ldots$&$\text{ context }(c,a)$&$4\un{b}\ldots\to\to 3\_e\ldots$&$\text{ context }(d,c)$\\
$4\un{b}\ldots\to\to 4\_c\ldots$&$\text{ context }(a,b)$&$4\un{e}\ldots\to\to 3\_b\ldots$&$\text{ context }(d,a)$\\
$5\un{c}\ldots\to\to 2\_e\ldots$&$\text{ context }(d,c)$&$5\un{c}\ldots\to\to 3\_b\ldots$&$\text{ context }(b,c)$\\
$5\un{e}\ldots\to\to 2\_e\ldots$&$\text{ context }(d,c)$&$5\un{e}\ldots\to\to 3\_b\ldots$&$\text{ context }(b,c)$\\
$1\ldots\un{a}\to\to 2\ldots b\_$&$\text{ context }\begin{array}{l}(c,d)\\(a,c)\\(d,a)\end{array}$&$1\ldots\un{b}\to\to2\ldots b\_$&$\text{ context }(c,d)$\\
$1\ldots\un{c}\to\to 4\ldots c\_$&$\text{ context }(e,b)$&$2\ldots\un{b}\to\to2\ldots b\_$&$\text{ context }(c,a)$\\
$2\ldots\un{b}\to\to3\ldots a\_$&$\text{ context }(e,a)$&$2\ldots \un{b}\to\to 3\ldots c\_$&$\text{ context }(b,b)$\\
$2\ldots\un{e}\to\to 3\ldots c\_$&$\text{ context }(a,c)$&$3\ldots\un{b}\to\to 2\ldots b\_$&$\text{ context }(c,a)$\\
$3\ldots \un{b}\to\to3\ldots a\_$&$\text{ context }(e,a)$&$3\ldots \un{b}\to\to 3\ldots c\_$&$\text{ context }(b,b)$\\
$3\ldots\un{c}\to\to 2\ldots b\_$&$\text{ context }\begin{array}{l}(c,a)\\(a,d)\\(d,c)\end{array}$&
$3\ldots\un{d}\to\to2\ldots b\_$&$\text{ context }\begin{array}{l}(c,d)\\(e,d)\end{array}$\\
$4\ldots\un{a}\to\to 3\ldots c\_$&$\text{ context }(e,b)$&$4\ldots\un{a}\to\to4\ldots b\_$&$\text{ context }(a,c)$\\
$4\ldots\un{d}\to\to 2\ldots b\_$&$\text{ context }\begin{array}{l}(c,d)\\(e,d)\end{array}$&
$5\ldots\un{a}\to\to 2\ldots b\_$&$\text{ context }\begin{array}{l}(a,c)\\(c,d)\\(d,a)\end{array}$\\
$5\ldots\un{b}\to\to 3\ldots b\_$&$\text{ context }(e,b)$&$5\ldots\un{b}\to\to5\ldots a\_$&$\text{ context }(a,c)$\\
$5\ldots\un{d}\to\to 2\ldots b\_$&$\text{ context }(e,c)$&$5\ldots\un{d}\to\to 4\ldots c\_$&$\text{ context }(c,c)$\\
\end{tabular}\end{equation}
\subsection{Some results that generate the IRR($n\ge 3$)}
This is the complete set if $n=3$.
The following are the results of applying $F$ to \eqref{irr2rllr}
\begin{equation}\label{set26.3}1\un{d}\ldots\to\to 4\_c\ldots\Rightarrow\left\{\begin{array}{l}
a:2\un{d}d\ldots\to\to 3\_bc\ldots\\
c:2\un{a}d\ldots\to\to2ab\ldots\\
d:2\un{c}d\ldots\to\to 5\_cc\ldots\end{array}\right.,\{1\alpha\un{d}\ldots\}\end{equation}

\begin{equation}\label{star}1\un{e}\ldots\to\to 4\_c\ldots\Rightarrow \left\{\begin{array}{l}
a:2\un{d}e\ldots\to\to 3\_bc\ldots\\c:2\un{a}e\ldots\to\to 2ab\ldots\\d:
2\un{c}e\ldots\to\to 5\_cc\ldots\end{array}\right.,\{1\alpha\un{e}\ldots\}\end{equation}
\begin{equation}1\un{\beta} e\ldots\to\to 4\_cc\ldots\Rightarrow c:2\un{a}\beta e\ldots\to\to 1abd\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}\label{set2.3.1}2\un{a}\ldots\to\to2\_a\ldots\Rightarrow b:\left.\begin{array}{l}1\un{d}a\ldots\\1\un{e}a\ldots\end{array}\right\}\to\to 4\_ca\ldots,\{2\alpha\un{a}\ldots\}\end{equation}
\begin{equation}2\un{a}c\ldots\to\to 2\_aa\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{107.3}2\un{c}\ldots\to\to5\_c\ldots\Rightarrow b:\left.\begin{array}{l}1\un{d}c\ldots\\1\un{e}c\ldots\end{array}\right\}\to\to3\_ec\ldots,\{2\alpha\un{c}\ldots\}\end{equation}
\begin{equation}2\un{c}b\ldots\to\to 5\_cd\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}2\un{c}c\ldots\to\to 5\_ca\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set2.3.2}2\un{d}\ldots\to\to2\_a\ldots\Rightarrow b:\left.\begin{array}{l}1\un{d}d\ldots\\1\un{e}d\ldots\end{array}\right\}\to\to 4\_ca\ldots,\{2\alpha\un{d}\ldots\}\end{equation}
\begin{equation}2\un{d}c\ldots\to\to 2\_ab\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set4.3}2\un{d}\ldots\to\to3\_b\ldots\Rightarrow b:\left.\begin{array}{l}1\un{d}d\ldots\\1\un{e}d\ldots\end{array}\right\}\to\to4\_cb\ldots,\{2\alpha\un{d}\ldots\}\end{equation}
\begin{equation}2\un{d}b\ldots\to\to 3\_bd\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set3.3}3\un{a}\ldots\to\to2\_a\ldots\Rightarrow \left\{\begin{array}{l}a:\left.\begin{array}{l}5\un{c}a\ldots\\5\un{e}a\ldots\end{array}\right\}\to\to 2db\ldots\\b:
3\un{e}a\ldots\to\to 4\_ca\ldots\\c:4\un{c}a\ldots\to\to 2ab\ldots\\\end{array}\right.,\{3\alpha\un{a}\ldots\}\end{equation}
\begin{equation}\label{set3.3nx}3\un{a}a\ldots\to\to 2\_ab\ldots\Rightarrow\left\{\begin{array}{l}a:\left.\begin{array}{l}5\un{c}aa\ldots\\5\un{e}aa\ldots\end{array}\right\}\to\to 3dbc\ldots\\b:\left.\begin{array}{l}1\un{d}dc\ldots\\1\un{e}dc\ldots\end{array}\right\}\to\to 4\_cab\ldots\\
c:4\un{c}aa\ldots\to\to 3abc\ldots\end{array}\right.,\{1\alpha a\un{c}\ldots\}\end{equation}

\begin{equation}\label{set7.3}3\un{e}\ldots\to\to3\_e\ldots\Rightarrow\left\{\begin{array}{l}a:\left.\begin{array}{l}5\un{c}e\ldots\\5\un{e}e\ldots\end{array}\right\}\to\to5ca\ldots\\b:3\un{e}e\ldots\to\to4\_ce\ldots\\c:4\un{c}e\ldots\to\to2\_ae\ldots\end{array}\right.,\{3\alpha\un{e}\ldots\}\end{equation}
\begin{equation}\label{set7.3.x}3\un{e}d\ldots\to\to 3\_ec\Rightarrow a:\left.\begin{array}{l}5\un{c}ed\ldots\\5\un{e}ed\ldots\end{array}\right\}\to\to 3caa\ldots,\emptyset\end{equation}
\begin{equation}\label{set6.3}3\un{e}\ldots\to\to4\_c\ldots\Rightarrow \left\{\begin{array}{l}a:\left.\begin{array}{l}5\un{c}e\ldots\\5\un{e}e\ldots\end{array}\right\}\to\to3\_bc\ldots\\b:3\un{e}e\ldots\to\to3bc\ldots\\c:4\un{c}e\ldots\to\to2ab\ldots\\\end{array}\right.,\{3\alpha\un{e}\ldots\}\end{equation}
\begin{equation}3\un{e}c\ldots\to\to 4\_ca\Rightarrow\left\{\begin{array}{l}b:3\un{e}ec\ldots\to\to 4bcc\ldots\\c:
4\un{c}ec\ldots\to\to 1abc\ldots\end{array}\right.,\{2\alpha e\un{e}\ldots\}\end{equation}
\begin{equation}\label{set8.3}4\un{b}\ldots\to\to3\_e\ldots\Rightarrow \left\{\begin{array}{l}b:4\un{b}b\ldots\to\to4\_ce\ldots\\c:3\un{a}b\ldots\to\to2\_ae\ldots\end{array}\right.,\{4\alpha\un{b}\ldots\}\end{equation}
\begin{equation}4\un{b}d\ldots\to\to 3\_ec\ldots\Rightarrow\emptyset,\{1\alpha b\un{b}\ldots\}\end{equation}
\begin{equation}\label{set9.3}4\un{b}\ldots\to\to4\_c\ldots\Rightarrow \left\{\begin{array}{l}b:4\un{b}b\ldots\to\to3bc\ldots\\c:3\un{a}b\ldots\to\to2ab\ldots\end{array}\right.,\{4\alpha\un{b}\ldots\}\end{equation}
\begin{equation}4\un{b}a\ldots\to\to 4\_cb\ldots\Rightarrow\left\{\begin{array}{l}b:4\un{b}ba\ldots\to\to 2bab\ldots\\c:
3\un{a}ba\ldots\to\to 3abc\ldots\end{array}\right.,\{5\alpha b\un{d}\ldots\}\end{equation}
\begin{equation}\label{set10.3}4\un{e}\ldots\to\to3\_b\ldots\Rightarrow\left\{\begin{array}{l}b:4\un{b}e\ldots\to\to4\_cb\ldots\\c:3\un{a}e\ldots\to\to2\_ab\ldots\end{array}\right.,\{4\alpha\un{e}\ldots\}\end{equation}
\begin{equation}4\un{e}d\ldots\to\to 3\_ba\ldots\Rightarrow\emptyset,\{1\alpha e\un{b}\ldots\}\end{equation}
\begin{equation}\label{set12.3}5\un{\beta}\ldots\to\to2\_e\ldots\Rightarrow a:4\un{e}\beta\ldots\to\to 2cb\ldots,\{5\alpha\un{\beta}\ldots\}\text{ for }\beta\in\{c,e\}\end{equation}
\begin{equation}5\un{\beta}d\ldots\to\to2\_ec\ldots\Rightarrow a:4\un{e}\beta d\ldots\to\to1cbd\ldots,\emptyset\text{ for }\beta\in\{c,e\}\end{equation}

\begin{equation}\label{set11.3}5\un{\beta}\ldots\to\to3\_b\ldots\Rightarrow a:4\un{e}\beta\ldots\to\to4cb\ldots,\{5\alpha\un{\beta}\ldots\}\text{ for }\beta\in\{c,e\}\end{equation}
\begin{equation}5\un{\beta}b\ldots\to\to 3\_bc\ldots\Rightarrow a:4\un{e}\beta b\ldots\to\to 3cbc\ldots,\emptyset\text{ for }\beta\in\{c,e\}\end{equation}
\begin{equation}1\ldots \un{a}\to\to 2\ldots b\_\Rightarrow\emptyset,\{1\ldots\un{a}\alpha\}\end{equation}
\begin{equation}1\ldots\un{b}\to\to 2\ldots b\_\Rightarrow\emptyset,\{1\ldots\un{b}\alpha\}\end{equation}
\begin{equation}1\ldots\un{c}\to\to 4\ldots c\_\Rightarrow\emptyset,\{1\ldots\un{c}\alpha\}\end{equation}
\begin{equation}\label{set14.3}2\ldots\un{b}\to\to2\ldots b\_\Rightarrow\left\{\begin{array}{l}a:3\ldots b\un{c}\to\to1\ldots bc\_\\
d:1\ldots b\un{a}\to\to1\ldots ba\_\\e:5\ldots b\un{a}\to\to 4\ldots cc\end{array}\right.,\{2\ldots\un{b}\alpha\}\end{equation}
\begin{equation}2\ldots c\un{b}\to\to 2\ldots ab\_\Rightarrow e:5\ldots cb\un{a}\to\to3\ldots bcc,\emptyset\end{equation}

\begin{equation}\label{set15.3}2\ldots\un{b}\to\to3\ldots a\_\Rightarrow\left\{\begin{array}{l}a:3\ldots b\un{c}\to\to 4\ldots ac\_\\
d:1\ldots b\un{a}\to\to2\ldots ec\\
e:5\ldots b\un{a}\to\to3\ldots ab\_\\\end{array}\right.,\{2\ldots\un{b}\alpha\}\end{equation}
\begin{equation}2\ldots e\un{b}\to\to3\ldots aa\_\Rightarrow d:1\ldots eb\un{a}\to\to 1\ldots cbd\_,\emptyset
\end{equation}

\begin{equation}\label{set13.3.1}2\ldots\un{b}\to\to 3\ldots c\_\Rightarrow \left\{\begin{array}{l}a:3\ldots b\un{c}\to\to4\ldots cc\_\\d:1\ldots b\un{a}\to\to2\ldots db\_\\e:5\ldots b\un{a}\to\to3\ldots cb\_\end{array}\right.,\{2\ldots\un{b}\alpha\}\end{equation}
\begin{equation}2\ldots b\un{b}\to\to3\ldots bc\_\Rightarrow\emptyset,\{1\ldots \un{d}b\alpha,1\ldots\un{e}b\alpha\}\end{equation}

\begin{equation}\label{set13.3.2}2\ldots\un{e}\to\to 3\ldots c\_\Rightarrow \left\{\begin{array}{l}a:3\ldots e\un{c}\to\to4\ldots cc\_\\d:1\ldots e\un{a}\to\to2\ldots db\_\\e:5\ldots e\un{a}\to\to3\ldots cb\_\end{array}\right.,\{2\ldots\un{e}\alpha\}\end{equation}
\begin{equation}2\ldots a\un{e}\to\to3\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set17.3}3\ldots\un{b}\to\to3\ldots a\_\Rightarrow\left\{\begin{array}{l}a:1\ldots b\un{c}\to\to4\ldots ac\_\\
b:4\ldots b\un{a}\to\to3\ldots bc\\
c:2\ldots b\un{e}\to\to2\ldots db\_\\
e:5\ldots b\un{b}\to\to3\ldots ab\_\end{array}\right.,\{3\ldots\un{b}\alpha\}\end{equation}
\begin{equation}3\ldots e\un{b}\to\to 3\ldots aa\_\Rightarrow b:4\ldots eb\un{a}\to\to 3\ldots cbc\_,\emptyset\end{equation}
\begin{equation}\label{set16.3}3\ldots\un{b}\to\to3\ldots c\_\Rightarrow\left\{\begin{array}{l}a:1\ldots b\un{c}\to\to4\ldots cc\_\\
b:4\ldots b\un{a}\to\to2\ldots ab\_\\
c:2\ldots b\un{e}\to\to2\ldots ab\_\\
e:5\ldots b\un{b}\to\to3\ldots cb\_\end{array}\right.,\{3\ldots\un{b}\alpha\}\end{equation}
\begin{equation}3\ldots b\un{b}\to\to 3\ldots bc\_\Rightarrow\left\{\begin{array}{l}
a: 5\ldots ea\un{d}\to\to 4\ldots bcc\_\\c:\left.\begin{array}{l}2\ldots ea\un{b}\\3\ldots ea\un{b}\end{array}\right\}\to\to2\ldots bab\_\\d:1\ldots ea\un{b}\to\to 2\ldots bdb\_\end{array}\right.,\{3\ldots\un{e}b\alpha\}\end{equation}
\begin{equation}\label{set18.3}3\ldots\un{\beta}\to\to2\ldots b\_\Rightarrow \left\{\begin{array}{l}a:1\ldots \beta\un{c}\to\to 1\ldots bc\_\\
b:4\ldots \beta\un{a}\to\to 3\ldots bc\_\\
c:2\ldots \beta\un{e}\to\to1\ldots bd\_\\
e:5\ldots \beta\un{b}\to\to4\ldots cc\end{array}\right.,\{3\ldots\un{\beta}\alpha\}\text{ for }\beta\in\{b,c,d\}\end{equation}
\begin{equation}3\ldots c\un{b}\to\to 2\ldots ab\_\Rightarrow e:5\ldots cb\un{b}\to\to 3\ldots bcc,\{4\ldots \un{c}b\alpha\}\end{equation}
\begin{equation}3\ldots a\un{c}\to\to 2\ldots db\_\Rightarrow \left\{\begin{array}{l}
a:\left.\begin{array}{l}1\ldots cd\un{c}\\5\ldots cd\un{d}\\1\ldots ed\un{c}\\5\ldots ed\un{d}\end{array}\right\}\to\to 1\ldots dbc\_\\
b:\left.\begin{array}{l}4\ldots cd\un{a}\\4\ldots ed\un{a}\end{array}\right\}\to\to 3\ldots dbc\_\\
c:\left.\begin{array}{l}2\ldots cd\un{e}\\2\ldots cd\un{b}\\3\ldots cd\un{b}\\2\ldots ed\un{e}\\2\ldots ed\un{b}\\3\ldots ed\un{b}\end{array}\right\}\to\to 1\ldots dbd\_\\
d:\left.\begin{array}{l}1\ldots cd\un{b}\\1\ldots ed\un{b}\end{array}\right\}\to\to 1\ldots dba\_\\
e:\left.\begin{array}{l}5\ldots cd\un{b}\\5\ldots ed\un{b}\end{array}\right\}\to\to 5\ldots ccc\end{array}\right.\end{equation}

\begin{equation}3\ldots d\un{c}\to\to 2\ldots cb\_\Rightarrow e:5\ldots dc\un{b}\to\to 1\ldots abd\_,\emptyset\end{equation}
\begin{equation}3\ldots c\un{d}\to\to 2\ldots db\_\Rightarrow e:5\ldots cd\un{b}\to\to 5\ldots ccc,\{4\ldots\un{c}d\alpha,2\ldots\un{a}b\alpha\}\end{equation}
\begin{equation}3\ldots e\un{d}\to\to 2\ldots db\_\Rightarrow e:5\ldots ed\un{b}\to\to 5\ldots ccc,\{4\ldots\un{c}d\alpha,2\ldots\un{a}b\alpha\}\end{equation}
\begin{equation}\label{set20.3}4\ldots\un{a}\to\to3\ldots c\_\Rightarrow \left\{\begin{array}{l}a:5\ldots a\un{d}\to\to4\ldots cc\_\\
c:\left.\begin{array}{l}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}\right\}\to\to2\ldots ab\_\\
d:1\ldots a\un{b}\to\to2\ldots db\_\end{array}\right.,\{4\ldots\un{a}\alpha\}\end{equation}
\begin{equation}4\ldots e\un{a}\to\to 3\ldots bc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set19.3}4\ldots\un{a}\to\to 4\ldots b\_\Rightarrow\left\{\begin{array}{l}a:5\ldots a\un{d}\to\to4\ldots cb\\
c:\left.\begin{array}{l}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}\right\}\to\to3\ldots bc\_\\d:1\ldots a\un{b}\to\to3\ldots ec\end{array}\right.,\{4\ldots\un{a}\alpha\}\end{equation}
\begin{equation}4\ldots a\un{a}\to\to 4\ldots cb\_\Rightarrow \left\{\begin{array}{l}a:5\ldots aa\un{d}\to\to 3\ldots abc\_\\d:1\ldots aa\un{b}\to\to 2\ldots aec\end{array}\right.,\emptyset\end{equation}

\begin{equation}\label{set21.3}4\ldots\un{d}\to\to 2\ldots b\_\Rightarrow\left\{\begin{array}{l}a:5\ldots d\un{d}\to\to1\ldots bc\_\\
c:\left.\begin{array}{l}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}\right\}\to\to1\ldots bd\_\\
d:1\ldots d\un{b}\to\to1\ldots ba\_\end{array}\right.,\{4\ldots\un{d}\alpha\}\end{equation}
\begin{equation}4\ldots c\un{d}\to\to2\ldots db\_\Rightarrow \emptyset,\{3\ldots\un{a}d\alpha\}\end{equation}
\begin{equation}4\ldots e\un{d}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set22.3}5\ldots \un{\beta}\to\to 2\ldots b\_\Rightarrow c:\left.\begin{array}{l}3\ldots \beta\un{d}\\4\ldots\beta\un{d}\end{array}\right\}\to\to 1\ldots bd\_,\{5\ldots\un{\beta}\alpha\}\text{ for }\beta\in\{a,d\}\end{equation}
\begin{equation}5\ldots a\un{a}\to\to 2\ldots cb\_\Rightarrow c:\left.\begin{array}{l}3\ldots ed\un{d}\\4\ldots ed\un{d}\end{array}\right\}\to\to 1\ldots cbd\_,\{4\ldots\un{e}a\alpha\}\end{equation}
\begin{equation}5\ldots c\un{a}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots d\un{a}\to\to 2\ldots ab\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots e\un{d}\to\to 2\ldots cb\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set24.3}5\ldots\un{b}\to\to3\ldots b\_\Rightarrow c:\left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to4\ldots ca,\{5\ldots\un{b}\alpha\}\end{equation}
\begin{equation}5\ldots e\un{b}\to\to 3\ldots bb\_\Rightarrow c:\left.\begin{array}{l}3\ldots eb\un{d}\\4\ldots eb\un{d}\end{array}\right\}\to\to 4\ldots bcc\_,\emptyset\end{equation}
\begin{equation}\label{set23.3}5\ldots\un{b}\to\to5\ldots a\_\Rightarrow c:\left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to3\ldots aa\_,\{5\ldots\un{b}\alpha\}\end{equation}
\begin{equation}5\ldots a\un{b}\to\to 5\ldots ca\_\Rightarrow\emptyset,\{4\ldots\un{e}b\alpha\}\end{equation}
\begin{equation}5\ldots\un{d}\to\to4\ldots c\_\Rightarrow c:\left.\begin{array}{l}3\ldots d\un{d}\\4\ldots d\un{d}\end{array}\right\}\to\to3\ldots cc\_,\{5\ldots\un{d}\alpha\}\end{equation}
\begin{equation}\label{set25.3}5\ldots c\un{d}\to\to 4\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}
The right hand members of the results in \eqref{set26.3}-\eqref{set25.3} represent all the IRR(3) and their derivations i.e. if the IGR's in this set that have length 3 are applied to the members of IRR(2), all the members of IRR(3) can be generated and no results in this list can be omitted for this purpose.
For the next step it must be verified that all the members of IRR(4) can be generated from the IRR(3) using appropriate IGR's which will be found. To to this $F$ needs to be applied to all members of the set \eqref{set26.3}-\eqref{set25.3} that have length 3. The others are their derivations one symbol at a time using the method described in Section~\ref{section5}.



\begin{comment} needed?
Otherwise the only difference is that the computation on the right proceeds as far as possible from where pointer would have stopped. For any of these cases of IGR's that generate non-extendable IRR's, the results of applying the context strings are written as separate IGR's (for example \eqref{set3.3c} is associated with \eqref{set3.3nx} that results from applying its context to its non-extendable parts). This is done so that ``$X\text{ context }(p,q)$" will be equivalent to ``$EX(X)\text{ context }(p,q)$" where the function $EX()$ picks out the extendable subset of the RHS's of an IGR. Thus whenever a ``context" occurs in an equation this is explicit in its expanded form. 

Thus the full forms could be generated and used for generating the IGR's for the next value of $n$, however as will be shown, by retaining the results as above, $F$ can be applied efficiently to these results to obtain the IRR for the next value of $n$. Repetition can be minimised because the minimised IGR's can be reused and, if not already stated, will be listed as auxiliary results before the final list of IGR's is given. These auxiliary results will be complete IGR's and so may include outlines for extendable and non-extendable IRR's. 

Because different elements of an IGR could have different lengths, such IGR's should be split up so that the lengths of each part are unique and each part treated separately. This has already been done in results \eqref{set26.3}-\eqref{set25.3} and is indicated in general in the splitting of the result of $F$ into the two terms in \eqref{eq_thm4.2}.
\end{comment}

\subsection{Additional results that generate the IRR(4)}
These are the results of applying $F$ to the RHS's of the IGR's that generate all the IRR(3).
\begin{equation}\label{set25.4}1\un{\gamma}\ldots\to\to 3\_e\ldots\Rightarrow\left\{\begin{array}{l}a:2\un{d}\gamma\ldots\to\to 5ca\ldots\\c:2\un{a}\gamma\ldots \to\to2\_ae\ldots\\d:2\un{c}\gamma\ldots\to\to5\_ce\ldots\end{array}\right.\text{ for }\gamma\in\{d,e\}\end{equation} 
\begin{equation}1\un{\beta}a\ldots\to\to 4\_ca\ldots\Rightarrow c:2\un{a}\beta a\ldots\to\to 1abc\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}ac\ldots\to\to 4\_caa\ldots\Rightarrow c:2\un{a}\beta ac\ldots\to\to 2abdb\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}c\ldots\to\to 3\_ec\ldots\Rightarrow a:2\un{d}\beta c\ldots\to\to 3caa\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}cb\ldots\to\to 3\_ecd\ldots\Rightarrow a:2\un{d}\beta cb\ldots\to\to 1ccbd\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}cc\ldots\to\to 3\_eca\ldots\Rightarrow a:2\un{d}\beta cc\ldots\to\to 4caac\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}d\ldots\to\to 4\_ca\ldots\Rightarrow c:2\un{a}\beta d\ldots\to\to 1abc\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}dc\ldots\to\to 4\_cab\ldots\Rightarrow
c:2\un{a}\beta dc\ldots\to\to 2abdb\ldots,\emptyset
\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta} d\ldots\to\to 4\_cb\ldots\Rightarrow c:2\un{a}\beta d\ldots\to\to 3abc\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}db\ldots\to\to 4\_cbd\ldots\Rightarrow c: 2\un{a}\beta db\ldots\to\to 2abdb\ldots,\emptyset\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}\label{set28.4}2\un{c}d\ldots\to\to5\_cc\ldots\Rightarrow\left\{\begin{array}{l}a:\left.\begin{array}{l}4\un{e}cc\ldots\\4\un{e}ec\ldots\\5\un{c}ad\ldots\\5\un{e}ad\ldots\end{array}\right\}\to\to 2\_ecc\ldots\\
b:\left.\begin{array}{l}1\un{d}aa\ldots\\1\un{e}aa\ldots\\1\un{d}ab\ldots\\1\un{e}ab\ldots\\4\un{b}cd\ldots\\3\un{e}ad\ldots\end{array}\right\}\to\to 3\_ecc\ldots\\
c:\left.\begin{array}{l}3\un{a}cd\ldots\\
4\un{c}ad\ldots\end{array}\right\}\to\to 1dbd\ldots\end{array}\right.,\left\{\begin{array}{l}1\alpha c\un{a}\ldots\\1\alpha c\un{b}\ldots\\3\alpha a\un{c}\ldots\\3\alpha c\un{d}\ldots\\4\alpha c\un{d}\ldots\\3\alpha e\un{d}\ldots\\4\alpha e\un{d}\ldots\end{array}\right\}\end{equation}
\begin{equation}2\un{c}de\ldots\to\to 5\_ccc\ldots\Rightarrow c:\left.\begin{array}{l}3\un{a}cde\ldots\\4\un{c}ade\ldots\end{array}\right\}\to\to 5\_ceca\ldots,\left\{\begin{array}{l}5cac\un{b}\ldots\\5ccd\un{b}\ldots\\5ced\un{b}\ldots\end{array}\right\}\end{equation}

\begin{equation}2\un{c}e\ldots\to\to 5\_cc\ldots\Rightarrow\emptyset,\{5\alpha c\un{a}\ldots\}\end{equation}
\begin{equation}\label{set29.4}2\un{d}d\ldots\to\to3\_bc\ldots\Rightarrow \left\{\begin{array}{l}b:\left.\begin{array}{l}1\un{d}ca\ldots\\1\un{e}ca\ldots\\4\un{b}cc\ldots\\4\un{b}cb\ldots\end{array}\right\}\to\to 4\_cbc\ldots\\
c:\left.\begin{array}{l}3\un{a}cc\ldots\\3\un{a}cb\ldots\end{array}\right\}\to\to2\_abc\ldots\end{array}\right.,\left\{\begin{array}{l}3\alpha c\un{c}\ldots\\1\alpha d\un{a}\ldots\\2\alpha c\un{b}\ldots\end{array}\right\}\end{equation}
\begin{equation}2\un{d}de\ldots\to\to 3\_bcc\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}2\un{d}e\ldots\to\to 3\_bc\ldots\Rightarrow\emptyset,\{5\alpha d\un{a}\ldots\}\end{equation}

\begin{equation}\label{224}3\un{a}b\ldots\to\to 2\_ae\ldots\Rightarrow\left\{\begin{array}{l}a:\left.\begin{array}{l}5\un{c}ab\ldots\\5\un{e}ab\ldots\end{array}\right\}\to\to 5\_ccc\ldots\\c:4\un{c}ab\ldots\to\to 3\_bcc\ldots\end{array}\right.,\{4\alpha a\un{a}\ldots\}\end{equation}
\begin{equation}3\un{a}bd\ldots\to\to 2\_aec\ldots\Rightarrow\left\{\begin{array}{l}
b:\left.\begin{array}{l}4\un{b}ecb\ldots\\4\un{b}eeb\ldots\end{array}\right\}\to\to 4\_caec\ldots,\left\{\begin{array}{l}2baa\un{b}\ldots\\3baa\un{b}\ldots\end{array}\right\}\\
c:\left.\begin{array}{l}3\un{a}ecb\ldots\\3\un{a}eeb\ldots\\4\un{c}abd\ldots\end{array}\right\}\to\to 2\_abcc\ldots,\left\{\begin{array}{l}2caa\un{b}\ldots\\3caa\un{b}\ldots\end{array}\right\}\end{array}\right.\end{equation}
\begin{equation}3\un{a}e\ldots\to\to 2\_ab\ldots\Rightarrow\left\{\begin{array}{l}a:\left.\begin{array}{l}5\un{c}ae\ldots\\5\un{e}ae\ldots\end{array}\right\}\to\to 3dbc\ldots\\b:4\un{b}eb\ldots\to\to 4\_cab\ldots\\c:\left.\begin{array}{l}4\un{c}ae\ldots\\3\un{a}eb\ldots\end{array}\right\}\to\to 3abc\ldots\end{array}\right.,\{5\alpha a\un{b}\ldots\}\end{equation}
\begin{equation}3\un{a}ed\ldots\to\to 2\_aba\ldots\Rightarrow\left\{\begin{array}{l}
a:\left.\begin{array}{l}5\un{c}aed\ldots\\5\un{e}aed\ldots\end{array}\right\}\to\to 4dbcc\ldots\\
c:\left.\begin{array}{l}4\un{c}aed\ldots\\3aebd\ldots\end{array}\right\}\to\to 4abcc\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}3\un{e}a\ldots\to\to 4\_ca\ldots\Rightarrow\left\{\begin{array}{l}b:3\un{e}ea\ldots\to\to 4bcc\ldots\\c:4\un{c}ea\ldots\to\to 1abc\ldots\end{array}\right.,\{1\alpha e\un{c}\ldots\}\end{equation}
\begin{equation}3\un{e}aa\ldots\to\to 4\_cab\ldots\Rightarrow\left\{\begin{array}{l}
b:3\un{e}eaa\ldots\to\to 4bccb\ldots\\c:4\un{c}eaa\ldots\to\to 2abdb\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}3\un{e}e\ldots\to\to 4\_ce\ldots\Rightarrow\left\{\begin{array}{l}b:3\un{e}ee\ldots\to\to 3bcb\ldots\\c:4\un{c}ee\ldots\to\to 3\_bcc\ldots\end{array}\right.,\{5\alpha e\un{b}\ldots\}\end{equation}
\begin{equation}3\un{e}ed\ldots\to\to 4\_cec\ldots\Rightarrow b:3\un{e}eed\ldots\to\to 1babc\ldots,\emptyset\end{equation}
\begin{equation}4\un{b}b\ldots\to\to 4\_ce\ldots\Rightarrow\left\{\begin{array}{l}b:4\un{b}bb\ldots\to\to 3bcb\ldots\\c:3\un{a}bb\ldots\to\to 3\_bcc\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{b}bd\ldots\to\to 4\_cec\ldots\Rightarrow b:4\un{b}bbd\ldots\to\to 1bcbc\ldots,\emptyset\end{equation}
\begin{equation}4\un{b}e\ldots\to\to 4\_cb\ldots\Rightarrow\left\{\begin{array}{l}b:4\un{b}be\ldots\to\to 2bab\ldots\\c:3\un{a}be\ldots\to\to 3abc\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{b}ed\ldots\to\to 4\_cba\ldots\Rightarrow\left\{\begin{array}{l}
b:4\un{b}bed\ldots\to\to 1babc\ldots\\
c:3\un{a}bed\ldots\to\to 4abcc\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}\label{set30.4}4\un{c}\ldots\to\to2\_a\ldots\Rightarrow \left\{\begin{array}{l}b:4\un{b}c\ldots\to\to4\_ca\ldots\\c:3\un{a}c\ldots\to\to 2ab\ldots\end{array}\right. \end{equation}
\begin{equation}4\un{c}e\ldots\to\to 2\_ae\ldots\Rightarrow c:3\un{a}ce\ldots\to\to 3\_bcc\ldots,\emptyset\end{equation}

\begin{equation}5\un{\beta}e\ldots\to\to 3\_bc\ldots\Rightarrow a:4\un{e}\beta e\ldots\to\to 3cbc\ldots,\emptyset\text{ for }\beta\in\{c,e\}\end{equation}
\begin{equation}5\un{\beta}ec\ldots\to\to 3\_bca\ldots\Rightarrow a:4\un{e}\beta ec\ldots\to\to 4cbcc\ldots,\emptyset\text{ for }\beta\in\{c,e\}\end{equation}
\begin{equation}1\ldots\un{a}\to\to 1\ldots d\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots b\un{a}\to\to 1\ldots ba\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}1\ldots b\un{a}\to\to 1\ldots bd\_\Rightarrow\emptyset,\emptyset\end{equation}


\begin{equation}1\ldots b\un{a}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots e\un{a}\to\to 2\ldots db\_\Rightarrow \emptyset,\emptyset\end{equation}

\begin{equation}1\ldots a\un{b}\to\to 2\ldots db\_\Rightarrow \emptyset,\{2\ldots\un{d}b\alpha\}\end{equation}
\begin{equation}1\ldots ea\un{b}\to\to 2\ldots bdb\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots d\un{b}\to\to 1\ldots ba\_\Rightarrow\emptyset,\{2\ldots\un{c}b\alpha\}\end{equation}
\begin{equation}1\ldots cd\un{b}\to\to 1\ldots dba\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots b\un{c}\to\to 1\ldots bc\_\Rightarrow\emptyset,\emptyset\end{equation}

\begin{equation}1\ldots b\un{c}\to\to 4\ldots ac\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots b\un{c}\to\to 4\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}

\begin{equation}1\ldots c\un{c}\to\to 1\ldots bc\_\Rightarrow\emptyset,\{2\ldots\un{a}c\alpha\}\end{equation}
\begin{equation}1\ldots ac\un{c}\to\to 1\ldots dbc\_\Rightarrow\emptyset,\emptyset\end{equation}

\begin{equation}1\ldots d\un{c}\to\to 1\ldots bc\_\Rightarrow\emptyset,\{2\ldots\un{c}c\alpha\}\end{equation}
\begin{equation}1\ldots ad\un{c}\to\to 1\ldots dbc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set31.4}2\ldots \un{b}\to\to 1\ldots d\_\Rightarrow \left\{\begin{array}{l}a:3\ldots b\un{c}\to\to 2\ldots ab\_\\
d:1\ldots b\un{a}\to\to 2\ldots db\_\\
e:5\ldots b\un{a}\to\to 2\ldots db\_\end{array}\right.\end{equation}
\begin{equation}2\ldots a\un{b}\to\to 2\ldots ab\_\Rightarrow e:5\ldots ab\un{a}\to\to 3\ldots bcc,\emptyset\end{equation}
\begin{equation}2\ldots ea\un{b}\to\to 2\ldots bab\_\Rightarrow e:5\ldots eab\un{a}\to\to 4\ldots cbcc,\emptyset\end{equation}
\begin{equation}2\ldots a\un{b}\to\to 3\ldots bc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}2\ldots d\un{b}\to\to 1\ldots bd\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}2\ldots b\un{e}\to\to 1\ldots bd\_\Rightarrow \emptyset,\left\{\begin{array}{l}1\ldots \un{d}e\alpha\\1\ldots\un{e}e\alpha\end{array}\right\}\end{equation}
\begin{equation}2\ldots ab\un{e}\to\to 1\ldots dbd\_\Rightarrow c: \left.\begin{array}{l} 3\ldots cba\un{d}\\4\ldots cba\un{d}\\3\ldots ccb\un{d}\\4\ldots ccb\un{d}\\3\ldots cbb\un{d}\\4\ldots cbb\un{d}\end{array}\right\}\to\to 5\ldots ceca,\left\{\begin{array}{l}2\ldots \un{d}de\alpha\\2\ldots \un{c}ae\alpha\\4\ldots cce\alpha\\4\ldots cbe\alpha\end{array}\right\}\end{equation}
\begin{equation}\label{set32.4}2\ldots \un{e}\to\to2\ldots b\_\Rightarrow\left\{\begin{array}{l}a:3\ldots e\un{c}\to\to1\ldots bc\_\\d:1\ldots e\un{a}\to\to1\ldots ba\_\\e:5\ldots e\un{a}\to\to 4\ldots cc\end{array}\right.\end{equation}
\begin{equation}2\ldots b\un{e}\to\to 2\ldots ab\_\Rightarrow e:5\ldots be\un{a}\to\to 3\ldots bcc,\left\{\begin{array}{l}1\ldots \un{d}e\alpha\\1\ldots\un{e}e\alpha\end{array}\right\}\end{equation}

\begin{equation}2\ldots bb\un{e}\to\to 2\ldots bab\_\Rightarrow e:5\ldots bbe\un{a}\to\to 4\ldots cbcc,\emptyset\end{equation}
\begin{equation}2\ldots b\un{e}\to\to 2\ldots db\_\Rightarrow e:5\ldots be\un{a}\to\to 5\ldots ccc,\left\{\begin{array}{l}1\ldots \un{d}e\alpha\\1\ldots \un{e}e\alpha\end{array}\right\}\end{equation}
\begin{equation}2\ldots eb\un{e}\to\to 2\ldots adb\_\Rightarrow e:5\ldots ebe\un{a}\to\to 2\ldots eccc,\emptyset\end{equation}
\begin{equation}\label{set33.4}2\ldots\un{e}\to\to 1\ldots d\_\Rightarrow\left\{\begin{array}{l}a:3\ldots e\un{c}\to\to 2\ldots ab\_\\
d:1\ldots e\un{a}\to\to 2\ldots db\_\\
e:5\ldots e\un{a}\to\to2\ldots db\_\end{array}\right.\end{equation}
\begin{equation}2\ldots\gamma\un{e}\to\to 1\ldots bd\_\Rightarrow\emptyset,\emptyset\text{ for }\gamma\in\{c,d\}\end{equation}
\begin{equation}2\ldots a\gamma \un{e}\to\to 1\ldots dbd\_\Rightarrow\emptyset,\emptyset\text{ for }\gamma\in\{c,d\}\end{equation}
\begin{equation}3\ldots a\un{b}\to\to 2\ldots ab\_\Rightarrow e:5\ldots ab\un{b}\to\to 3\ldots bcc,\left\{\begin{array}{l}5\ldots\un{c}b\alpha\\5\ldots\un{e}b\alpha\end{array}\right\}\end{equation}
\begin{equation}3\ldots ea\un{b}\to\to 2\ldots bab\_\Rightarrow e: 5\ldots eab\un{b}\to\to 4\ldots cbcc,\emptyset\end{equation}
\begin{equation}3\ldots a\un{b}\to\to 3\ldots bc\_\Rightarrow\emptyset,\left\{\begin{array}{l}5\ldots\un{c}b\alpha\\5\ldots\un{e}b\alpha\end{array}\right\}\end{equation}
\begin{equation}\label{set34.4}
3\ldots\un{b}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}a:1\ldots b\un{c}\to\to 2\ldots ab\_\\
b:4\ldots b\un{a}\to\to 5\ldots cd\\c:2\ldots b\un{e}\to\to 5\ldots ca\\
e:5\ldots b\un{b}\to\to2\ldots db\_\end{array}\right.\end{equation}

\begin{equation}3\ldots d\un{b}\to\to 1\ldots bd\_\Rightarrow\left\{\begin{array}{l}b:4\ldots db\un{a}\to\to 3\ldots ecd\\c:2\ldots db\un{e}\to\to 3\ldots eca\end{array}\right.,\emptyset\end{equation}
\begin{equation}3\ldots cd\un{b}\to\to 1\ldots dbd\_\Rightarrow\left\{\begin{array}{l}
b:4\ldots cdb\un{a}\to\to 5\ldots cecd\\c:2\ldots cdb\un{e}\to\to 5\ldots ceca\end{array}\right.,\emptyset\end{equation}
\begin{equation}\label{set35.4}3\ldots \un{c}\to\to1\ldots c\_\Rightarrow \left\{\begin{array}{l}a:1\ldots c\un{c}\to\to 2\ldots db\_\\
b:4\ldots c\un{a}\to\to2\ldots db\_\\
c:2\ldots c\un{e}\to\to 2\ldots aa\\
e:5\ldots c\un{b}\to\to2\ldots cb\_\end{array}\right.\end{equation}
\begin{equation}3\ldots b\un{c}\to\to 1\ldots bc\_\Rightarrow\left\{\begin{array}{l}
c:2\ldots bc\un{e}\to\to 4\ldots caa\\a:3\ldots ee\un{c}\to\to 2\ldots bdb\_\\
d:1\ldots ee\un{a}\to\to 2\ldots bcb\_\\e:5\ldots ee\un{a}\to\to 2\ldots bcb\_\end{array}\right.,\{3\ldots \un{e}c\alpha\}\end{equation}
\begin{equation}3\ldots cb\un{c}\to\to 1\ldots abc\_\Rightarrow c:2\ldots cbc\un{e}\to\to 3\ldots bcaa,\{4\ldots\un{c}ec\alpha\}\end{equation}
\begin{equation}\label{set36.4}3\ldots\un{c}\to\to 4\ldots c\_\Rightarrow\left\{\begin{array}{l}
a:1\ldots c\un{c}\to\to 2\ldots ab\\
b:4\ldots c\un{a}\to\to4\ldots cb\_\\
c:2\ldots c\un{e}\to\to3\ldots cc\_\\
e:5\ldots c\un{b}\to\to5\ldots ca\_\end{array}\right.\end{equation}

\begin{equation}3\ldots b\un{c}\to\to 4\ldots ac\_\Rightarrow\left\{\begin{array}{l}
a:\left.\begin{array}{l}1\ldots bc\un{c}\\
3\ldots ee\un{c}\end{array}\right\}\to\to 3\ldots dbc\_\\
d:1\ldots ee\un{a}\to\to 2\ldots adb\_\\
e:5\ldots ee\un{a}\to\to 5\ldots aca\_\end{array}\right.,\{3\ldots \un{e}c\alpha\}\end{equation}

\begin{equation}3\ldots eb\un{c}\to\to 4\ldots aac\_\Rightarrow \emptyset,\emptyset\end{equation}

\begin{equation}3\ldots b\un{c}\to\to 4\ldots cc\_\Rightarrow\left\{\begin{array}{l}
a:3\ldots ee\un{c}\to\to 1\ldots abc\_\\d:1\ldots ee\un{a}\to\to 2\ldots cdb\_\\e:5\ldots ee\un{a}\to\to 5\ldots cca\_\\a:1\ldots bc\un{c}\to\to 3\ldots abc\_\end{array}\right.,\{3\ldots \un{e}c\alpha\}\end{equation}


\begin{equation}3\ldots e\un{c}\to\to 4\ldots cc\_\Rightarrow a:1\ldots ec\un{c}\to\to 3\ldots abc\_,\emptyset\end{equation}
\begin{equation}3\ldots ae\un{c}\to\to 4\ldots ccc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set37.4}3\ldots\un{d}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}a:1\ldots d\un{c}\to\to2\ldots ab\_\\b:4\ldots d\un{a}\to\to 5\ldots cd\\c:2\ldots d\un{e}\to\to 5\ldots ca\\e:5\ldots d\un{b}\to\to 2\ldots db\_\end{array}\right.\end{equation}
\begin{equation}3\ldots a\un{d}\to\to 1\ldots bd\_\Rightarrow\left\{\begin{array}{l}
b:4\ldots ad\un{a}\to\to 3\ldots ecd\\c:2\ldots ad\un{e}\to\to 3\ldots eca\end{array}\right.,\left\{\begin{array}{l}5\ldots\un{c}d\alpha\\5\ldots\un{e}d\alpha\end{array}\right\}\end{equation}
\begin{equation}3\ldots aa\un{d}\to\to 1\ldots cbd\_\Rightarrow\left\{\begin{array}{l}
b: 4\ldots aad\un{a}\to\to 2\ldots aecd\\c: 2\ldots aad\un{e}\to\to 3\ldots aeca\end{array}\right.,
\left\{\begin{array}{l}4\ldots \un{e}cd\alpha\\4\ldots\un{e}ed\alpha\end{array}\right\}\end{equation}
\begin{equation}3\ldots ca\un{d}\to\to 1\ldots dbd\_\Rightarrow\left\{\begin{array}{l}
b:4\ldots cad\un{a}\to\to 5\ldots cecd\\c: 2\ldots cad\un{e}\to\to 5\ldots ceca\end{array}\right.,\emptyset\end{equation}
\begin{equation}3\ldots da\un{d}\to\to 1\ldots abd\_\Rightarrow\left\{\begin{array}{l}
b:4\ldots dad\un{a}\to\to 1\ldots ccbd\_\\c:2\ldots dad\un{e}\to\to 4\ldots caac\_\end{array}\right.,\emptyset\end{equation}
\begin{equation}3\ldots d\un{d}\to\to 1\ldots bd\_\Rightarrow\left\{\begin{array}{l}
b:4\ldots dd\un{a}\to\to 3\ldots ecd\\c:2\ldots dd\un{e}\to\to 3\ldots eca\end{array}\right.,\emptyset\end{equation}
\begin{equation}3\ldots ed\un{d}\to\to 1\ldots cbd\_\Rightarrow\left\{\begin{array}{l}
b:4\ldots edd\un{a}\to\to 2\ldots aecd\\c: 2\ldots edd\un{e}\to\to 3\ldots aeca\end{array}\right.,\emptyset\end{equation}
\begin{equation}\label{set38.4}3\ldots \un{d}\to\to 3\ldots a\_\Rightarrow\left\{\begin{array}{l}
a:1\ldots d\un{c}\to\to4\ldots ac\_\\
b:4\ldots d\un{a}\to\to 3\ldots bc\\
c:2\ldots d\un{e}\to\to2\ldots db\_\\
e:5\ldots d\un{b}\to\to3\ldots ab\_\end{array}\right.\end{equation}
\begin{equation}3\ldots b\un{d}\to\to 3\ldots aa\_\Rightarrow b:4\ldots bd\un{a}\to\to 3\ldots cbc\_,\{3\ldots\un{e}d\alpha\}\end{equation}
\begin{equation}3\ldots ab\un{d}\to\to 3\ldots caa\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set39.4}3\ldots \un{d}\to\to3\ldots c\_\Rightarrow\left\{\begin{array}{l}
a:1\ldots d\un{c}\to\to4\ldots cc\_\\
b:4\ldots d\un{a}\to\to2\ldots ab\_\\
c:2\ldots d\un{e}\to\to2\ldots ab\_\\
e:5\ldots d\un{b}\to\to3\ldots cb\_\end{array}\right.\end{equation}
\begin{equation}3\ldots d\un{d}\to\to 3\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}3\ldots cd\un{d}\to\to 3\ldots ccc\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}\label{ex13_1}3\ldots\un{d}\to\to 4\ldots c\_\Rightarrow\left\{\begin{array}{l}
a:1\ldots d\un{c}\to\to 2\ldots ab\\b:4\ldots d\un{a}\to\to 4\ldots cb\_\\c:2\ldots d\un{e}\to\to 3\ldots cc\_\\e:5\ldots d\un{b}\to\to 5\ldots ca\_\end{array}\right.\end{equation}

\begin{equation}\label{ex13_2}3\ldots b\un{d}\to\to 4\ldots cc\_\Rightarrow a: 1\ldots bd\un{c}\to\to 3\ldots abc\_,\{3\ldots \un{e}d\alpha\}\end{equation}
\begin{equation}3\ldots eb\un{d}\to\to 4\ldots bcc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}\label{set40.4}4\ldots \un{a}\to\to2\ldots b\_\Rightarrow \left\{\begin{array}{l}
a:5\ldots a\un{d}\to\to1\ldots bc\_\\
c:\left.\begin{array}{l}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}\right\}\to\to 1\ldots bd\_\\
d:1\ldots a\un{b}\to\to 1\ldots ba\_\end{array}\right.\end{equation}
\begin{equation}4\ldots b\un{a}\to\to2\ldots ab\_\Rightarrow \left.c:\begin{array}{l}3\ldots bd\un{d}\\4\ldots bd\un{d}\end{array}\right\}\to\to1\ldots abd\_,\{4\ldots\un{b}a\alpha\}\end{equation}
\begin{equation}4\ldots ab\un{a}\to\to 3\ldots dbc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}4\ldots bb\un{a}\to\to 2\ldots bab\_\Rightarrow a:\left.\begin{array}{l}
3\ldots bbd\un{d}\\4\ldots bbd\un{d}\end{array}\right\}\to\to 1\ldots babc\_,\{4\ldots \un{b}ba\alpha\}\end{equation}
\begin{equation}4\ldots b\un{a}\to\to 3\ldots bc\_\Rightarrow \left.c:\begin{array}{l}3\ldots bd\un{d}\\4\ldots bd\un{d}\end{array}\right\}\to\to 2\ldots bab\_,\{4\ldots \un{b}a\alpha\}\end{equation}
\begin{equation}4\ldots eb\un{a}\to\to 3\ldots cbc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}4\ldots c\un{a}\to\to 3\ldots bc\_\Rightarrow \emptyset,\left\{\begin{array}{l}3\ldots\un{a}a\alpha\\2\ldots\un{d}c\alpha\end{array}\right\}\end{equation}
\begin{equation}4\ldots ac\un{a}\to\to 3\ldots dbc\_\Rightarrow \emptyset,\left\{\begin{array}{l}5\ldots\un{c}aa\alpha\\5\ldots\un{e}aa\alpha\end{array}\right\}\end{equation}
\begin{equation}4\ldots d\un{a}\to\to 3\ldots bc\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}\label{set41.4}4\ldots\un{d}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}a:5\ldots d\un{d}\to\to2\ldots ab\_\\\left.c:\begin{array}{l}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}\right\}\to\to 5\ldots ca\\d:1\ldots d\un{b}\to\to2\ldots db\_\end{array}\right.\end{equation}
\begin{equation}4\ldots\beta\un{d}\to\to 1\ldots bd\_\Rightarrow c:\left.\begin{array}{l}
2\ldots\beta d\un{b}\\3\ldots\beta d\un{b}\end{array}\right\}\to\to 3\ldots eca,\emptyset\text{ for }\beta\in\{a,d\}\end{equation}
\begin{equation}4\ldots aa\un{d}\to\to 1\ldots cbd\_\Rightarrow c:\left.\begin{array}{l}
2\ldots aad\un{b}\\3\ldots aad\un{b}\end{array}\right\}\to\to 2\ldots aeca,\emptyset\end{equation}
\begin{equation}4\ldots ca\un{d}\to\to 1\ldots dbd\_\Rightarrow c:\left.\begin{array}{l}
2\ldots cad\un{b}\\3\ldots cad\un{b}\end{array}\right\}\to\to 5\ldots ceca,\emptyset\end{equation}
\begin{equation}4\ldots da\un{d}\to\to 1\ldots abd\_\Rightarrow c:\left.\begin{array}{l}2\ldots dad\un{b}\\3\ldots dad\un{b}\end{array}\right\}\to\to 4\ldots caac\_,\emptyset\end{equation}
\begin{equation}4\ldots ed\un{d}\to\to 1\ldots cbd\_\Rightarrow c:\left.\begin{array}{l}
2\ldots edd\un{b}\\3\ldots edd\un{b}\end{array}\right\}\to\to 2\ldots aeca,\emptyset\end{equation} 
\begin{equation}\label{set42.4}4\ldots \un{d}\to\to3\ldots a\_\Rightarrow\left\{\begin{array}{l}
a:5\ldots d\un{d}\to\to4\ldots ac\_\\c:
\left.\begin{array}{l}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}\right\}\to\to2\ldots db\_\\
d:1\ldots d\un{b}\to\to 2\ldots ec\end{array}\right.\end{equation}
\begin{equation}4\ldots b\un{d}\to\to 3\ldots aa\_\Rightarrow d:1\ldots bd\un{b}\to\to 1\ldots cbd\_,\{4\ldots\un{b}d\alpha\}\end{equation}
\begin{equation}4\ldots ab\un{d}\to\to 3\ldots caa\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}\label{set43.4}4\ldots\un{d}\to\to3\ldots c\_\Rightarrow\left\{\begin{array}{l}a:5\ldots d\un{d}\to\to4\ldots cc\_\\c:
\left.\begin{array}{l}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}\right\}\to\to2\ldots ab\_\\
d:1\ldots d\un{b}\to\to 2\ldots db\_\end{array}\right.\end{equation}
\begin{equation}4\ldots\un{d}\to\to 4\ldots c\_\Rightarrow\left\{\begin{array}{l}a:5\ldots d\un{d}\to\to 2\ldots ab\\
c:\left.\begin{array}{l}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}\right\}\to\to 3\ldots cc\_\\
d:1\ldots d\un{b}\to\to 2\ldots db\_\end{array}\right.\end{equation}
\begin{equation}4\ldots b\un{d}\to\to 4\ldots cc\_\Rightarrow a:5\ldots bd\un{d}\to\to 3\ldots abc\_,\{4\ldots\un{b}d\alpha\}\end{equation}
\begin{equation}4\ldots eb\un{d}\to\to 4\ldots bcc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}4\ldots d\un{d}\to\to 3\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots\un{a}\to\to 3\ldots b\_\Rightarrow c:\left.\begin{array}{l}3\ldots a\un{d}\\4\ldots a\un{d}\end{array}\right\}\to\to 4\ldots ca\end{equation}
\begin{equation}5\ldots b\un{a}\to\to 3\ldots ab\_\Rightarrow c:\left.\begin{array}{l}
3\ldots ba\un{d}\\4\ldots ba\un{d}\end{array}\right\}\to\to 3\_bca\ldots,\emptyset\end{equation}
\begin{equation}5\ldots eb\un{a}\to\to 3\ldots aab\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}5\ldots \beta\un{a}\to\to 3\ldots cb\_\Rightarrow c:\left.\begin{array}{l}3\ldots \beta a\un{d}\\4\ldots \beta a\un{d}\end{array}\right\}\to\to 1\ldots abc\_,\emptyset\text{ for }\beta\in\{b,e\}\end{equation}
\begin{equation}5\ldots b\beta\un{a}\to\to 3\ldots bcb\_\Rightarrow\emptyset,\emptyset\text{ for }\beta\in\{b,e\}\end{equation}
\begin{equation}5\ldots\un{b}\to\to 1\ldots d\_\Rightarrow c:\left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to 5\ldots ca\end{equation}
\begin{equation}5\ldots c\un{b}\to\to 1\ldots bd\_\Rightarrow c:\left.\begin{array}{l}3\ldots cb\un{d}\\4\ldots cb\un{d}\end{array}\right\}\to\to 3\ldots eca,\emptyset\end{equation}
\begin{equation}5\ldots dc\un{b}\to\to 1\ldots abd\_\Rightarrow\left.c:\begin{array}{l}3\ldots dcbd\\4\ldots dcbd\end{array}\right\}\to\to 4\ldots caac\_,\emptyset\end{equation}
\begin{equation}5\ldots\un{b}\to\to 3\ldots b\_\Rightarrow c:\left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to4\ldots ca\end{equation}
\begin{equation}5\ldots b\un{b}\to\to 3\ldots ab\_\Rightarrow c:\left.\begin{array}{l}3\ldots bb\un{d}\\4\ldots bb\un{d}\end{array}\right\}\to\to 3\ldots bca,\emptyset\end{equation}
\begin{equation}5\ldots eb\un{b}\to\to 3\ldots aab\_\Rightarrow c:\left.\begin{array}{l}3\ldots ebb\un{d}\\4\ldots ebb\un{d}\end{array}\right\}\to\to 4\ldots cbcc\_,\emptyset\end{equation}
\begin{equation}5\ldots b\un{b}\to\to 3\ldots cb\_\Rightarrow c:\left.\begin{array}{l}3\ldots bb\un{d}\\4\ldots bb\un{d}\end{array}\right\}\to\to 1\ldots abc\_,\emptyset\end{equation}
\begin{equation}5\ldots bb\un{b}\to\to 3\ldots bcb\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}5\ldots\un{d}\to\to 1\ldots c\_\Rightarrow c:\left.\begin{array}{l}3\ldots d\un{d}\\4\ldots d\un{d}\end{array}\right\}\to\to 2\ldots aa\end{equation}
\begin{equation}5\ldots d\un{d}\to\to 1\ldots bc\_\Rightarrow c:\left.\begin{array}{l}3\ldots dd\un{d}\\4\ldots dd\un{d}\end{array}\right\}\to\to 4\ldots caa,\emptyset\end{equation}
\begin{equation}5\ldots cd\un{d}\to\to 1\ldots dbc\_\Rightarrow c:\left.\begin{array}{l}
3\ldots cdd\un{d}\\4\ldots cdd\un{d}\end{array}\right\}\to\to 5\ldots ccaa,\emptyset\end{equation}
\begin{equation}5\ldots\un{d}\to\to 3\ldots c\_\Rightarrow c:\left.\begin{array}{l}3\ldots d\un{d}\\4\ldots d\un{d}\end{array}\right\}\to\to 2\ldots ab\_\end{equation}
\begin{equation}5\ldots a\un{d}\to\to 3\ldots bc\_\Rightarrow\emptyset,\{4\ldots \un{e}d\alpha\}\end{equation}
\begin{equation}5\ldots aa\un{d}\to\to 3\ldots abc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots a\un{d}\to\to 4\ldots cc\_\Rightarrow\emptyset,\{4\ldots\un{e}d\alpha\}\end{equation}
\begin{equation}5\ldots ea\un{d}\to\to 4\ldots bcc\_\Rightarrow\emptyset,\emptyset\end{equation}
\subsection{Additional results for generating the IRR(5)}
\begin{equation}3\un{a}\ldots\to\to 5\_c\ldots\Rightarrow\left\{\begin{array}{l}
a:\left.\begin{array}{l}5\un{c}a\ldots\\5\un{e}a\ldots\end{array}\right\}\to\to 2\_ec\ldots\\
b:3\un{e}a\ldots\to\to 3\_ec\ldots\\
c:4\un{c}a\ldots\to\to 2db\ldots\end{array}\right.\end{equation}
\begin{equation}3\un{a}c\ldots\to\to5\_ce\ldots\Rightarrow c:4\un{c}ac\to\to 5\_ccc\ldots,\{2\alpha a\un{e}\ldots\}\end{equation}
\begin{equation}3\un{a}cd\ldots\to\to 5\_cec\ldots\Rightarrow\emptyset,\{1\alpha ae\un{a}\ldots\}\end{equation}
\begin{equation}3\un{a}cde\ldots\to\to 5\_ceca\ldots\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}4\un{c}\ldots\to\to 5\_c\ldots\Rightarrow \left\{\begin{array}{l}
b:4\un{b}c\ldots\to\to 3\_ec\ldots\\c: 3\un{a}c\ldots\to\to 2db\ldots\end{array}\right.\end{equation}
\begin{equation}4\un{c}a\ldots\to\to 5\_ce\ldots\Rightarrow c:3\un{a}ca\ldots\to\to 5\_ccc\ldots,\{5\alpha c\un{d}\ldots\}\end{equation}
\begin{equation}4\un{c}ad\ldots\to\to 5\_cec\ldots\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}4\un{b}e\ldots\to\to 4\_ca\ldots\Rightarrow\left\{\begin{array}{l}
b:4\un{b}be\ldots\to\to 4bcc\ldots\\c:3\un{a}be\ldots\to\to 1abc\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{b}ec\ldots\to\to 4\_cae\ldots\Rightarrow\left\{\begin{array}{l}
b:4\un{b}eeb\ldots\to\to 5bcca\ldots\\c:3\un{a}bec\ldots\to\to 2abcb\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{b}ecb\ldots\to\to 4\_caec\ldots\Rightarrow\left\{\begin{array}{l}
b:4\un{b}eebb\ldots\to\to 3bcaaa\ldots\\c:3\un{a}becb\ldots\to\to 1abcbd\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{b}ee\ldots\to\to 4\_cae\ldots\Rightarrow\left\{\begin{array}{l}
b:4\un{b}bee\ldots\to\to 5bcca\ldots\\c:3\un{a}bee\ldots\to\to 2abcb\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{b}eeb\ldots\to\to 4\_caec\ldots\Rightarrow\left\{\begin{array}{l}
b:4\un{b}beeb\ldots\to\to 3bccaa\ldots\\c:3\un{a}beeb\ldots\to\to 1abcbd\ldots\end{array}\right.,\emptyset\end{equation}
\*************** 2020-02-25 *********************

\begin{equation}2\un{a}d\ldots\to\to 2\_ae\ldots\Rightarrow
\left.\begin{array}{l}1\un{d}da\ldots\\1\un{e}da\ldots\end{array}\right\}\to\to 4\_cae\ldots,\left\{\begin{array}{l}1\alpha a\un{a}\ldots\\3\alpha d\un{c}\ldots\end{array}\right\}\end{equation}
\begin{equation}2\un{a}e\ldots\to\to 2\_ae\ldots\Rightarrow\left\{\begin{array}{l}4\un{b}ea\ldots\to\to 4\_cae\ldots\\3\un{a}ea\ldots\to\to 3\_bcc\ldots\end{array}\right.,\left\{\begin{array}{l}5\alpha a\un{a}\ldots\\5\alpha e\un{d}\ldots\end{array}\right\}\end{equation}
\begin{equation}2\un{c}d\ldots\to\to 5\_ce\ldots\Rightarrow\left\{\begin{array}{l}
\left.a:\begin{array}{l}4\un{e}cc\ldots\\4\un{e}ec\ldots\\5\un{c}ad\ldots\\5\un{e}ad\ldots\end{array}\right\}\to
\to 2\_ece\ldots\\
\left.b:\begin{array}{l}1\un{d}ab\ldots\\1\un{e}ab\ldots\\1\un{d}aa\ldots\\1\un{e}aa\ldots\\3\un{e}ad\ldots\\4\un{b}cd\ldots\end{array}\right\}\to\to 3\_ece\ldots\\
\left.c:\begin{array}{l}3\un{a}cd\ldots\\4\un{c}ad\ldots\end{array}\right\}\to\to 5\_ccc\ldots\end{array}\right.,\left\{\begin{array}{l}1\alpha c\un{a}\ldots\\3\alpha a\un{c}\ldots\\3\alpha c\un{d}\ldots\\4\alpha c\un{d}\ldots\\
3\alpha e\un{d}\ldots\\4\alpha e\un{d}\ldots\\1\alpha c\un{b}\ldots\end{array}\right\}\end{equation}
\begin{equation}2\un{c}e\ldots\to\to 5\_ce\ldots\Rightarrow \emptyset,\{5\alpha c\un{a}\ldots\}\end{equation}
\begin{equation}4\un{e}\ldots\to\to 2\_e\ldots\Rightarrow \left\{\begin{array}{l}b:4\un{b}e\ldots\to\to 4\_ce\ldots\\c:3\un{a}e\ldots\to\to 2db\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}4\un{e}c\ldots\to\to 2\_ec\ldots\Rightarrow c:3\un{a}ec\ldots\to\to 1dbd\ldots,\{2\alpha e\un{b}\ldots,3\alpha e\un{b}\ldots\}\end{equation}
\begin{equation}4\un{e}cc\ldots\to\to 2\_ecc\ldots\Rightarrow c:3\un{a}ecc\ldots\to\to 5\_ceca\ldots,\{2\alpha eb\un{e}\ldots\}\end{equation}

\begin{equation}4\un{e}e\ldots\to\to 2\_ec\ldots\Rightarrow c:3\un{a}ee\ldots\to\to 1dbd\ldots,\emptyset\end{equation}

\begin{equation}4\un{e}ec\ldots\to\to 2\_ecc\ldots\Rightarrow c:3\un{a}eec\ldots\to\to 5\_ceca\ldots,\emptyset\end{equation}
******************
\begin{equation}\label{set1.4}3\un{e}e\ldots\to\to 4\_ce\ldots\Rightarrow \left\{\begin{array}{l}4\un{c}ee\ldots\to\to 3\_bcc\ldots\\
3\un{e}ee\ldots\to\to 3bcb\ldots\end{array}\right.\end{equation}
\begin{equation}\label{set2.4}4\un{b}b\ldots\to\to 4\_ce\ldots\Rightarrow 3\un{a}bb\ldots\to\to 3\_bcc\ldots\end{equation}
\begin{equation}\label{set3.4}3\un{a}b\ldots\to\to 2\_ae\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}ab\ldots\\5\un{e}ab\ldots\end{array}\right\}\to\to 5\_ccc\ldots\\
4\un{c}ab\ldots\to\to 3\_bcc\ldots\end{array}\right.\end{equation}

\begin{equation}3\un{a}\ldots\to\to 3\_b\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}a\ldots\\5\un{e}a\ldots\end{array}\right\}\to\to 4cb\ldots\\3\un{e}a\ldots\to\to 4\_cb\ldots\\4\un{c}a\ldots\to\to 2\_ab\ldots\end{array}\right.\end{equation}
\begin{equation}3\un{a}e\ldots\to\to 3\_bc\ldots\Rightarrow\left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}ae\ldots\\5\un{e}ae\ldots\end{array}\right\}\to\to 3cbc\ldots\\
4\un{b}eb\ldots\to\to4\_cbc\ldots\\
3\un{a}eb\ldots\to\to 2\_abc\ldots\end{array}\right.,\{5\alpha a\un{b}\ldots\}\end{equation}
\begin{equation}1\un{\gamma}\delta\ldots\to\to \text{ anything }\ldots\Rightarrow \emptyset ,\emptyset\text{ for }\gamma \in\{d,e\},\delta\in\{a,c,d\}\end{equation}
\begin{equation}1\un{d}\ldots\to\to3\_e\ldots\Rightarrow\left\{\begin{array}{l}2d\un{d}\ldots\to\to 5ca\ldots\\2\un{a}d\ldots\to\to 2\_ae\ldots\\2\un{c}d\ldots\to\to 5\_ce\ldots\end{array}\right.\end{equation}
\begin{equation}1\un{e}\ldots\to\to 3\_e\ldots\Rightarrow\left\{\begin{array}{l}2\un{d}e\ldots\to\to 5ca\ldots\\2\un{a}e\ldots\to\to 2\_ae\ldots\\2\un{c}e\ldots\to\to 5\_ce\ldots\end{array}\right.\end{equation}

\begin{equation}\label{set4.4}3\un{a}e\ldots\to\to 2\_ab\ldots\Rightarrow 4\un{b}eb\ldots\to\to 4\_cab\ldots\end{equation}
\begin{equation}4\un{b}c\ldots\to\to 4\_ca\ldots\Rightarrow\left\{\begin{array}{l}
4\un{b}bc\ldots\to\to 4bcc\ldots\\3\un{a}bc\ldots\to\to 1abc\ldots\\a:\left.\begin{array}{l}
2\un{d}db\ldots\\2\un{d}eb\ldots\\5\un{c}eb\ldots\\5\un{e}eb\ldots\end{array}\right\}\to\to 3\_bca\ldots\\
b:3\un{e}eb\ldots\to\to 4bcc\ldots\\c:\left.\begin{array}{l}2\un{a}db\ldots\\2\un{a}eb\ldots\\4\un{c}eb\ldots\end{array}\right\}\to\to 1abc\ldots\\d:\left.\begin{array}{l}2\un{c}db\ldots\\2\un{c}eb\ldots\end{array}\right\}\to\to 5\_cca\ldots\end{array}\right.,\left\{\begin{array}{l}2\alpha b\un{b}\ldots\\3\alpha b\un{b}\ldots\\4\alpha e\un{a}\ldots\end{array}\right\}\end{equation}
\begin{equation}4\un{b}e\ldots\to\to 4\_ca\ldots\Rightarrow\left\{\begin{array}{l}4\un{b}be\ldots\to\to 4bcc\ldots\\3\un{a}be\ldots\to\to 1abc\ldots\end{array}\right.,\emptyset\end{equation}
\begin{equation}1\ldots\un{a}\to\to 1\ldots a\_\Rightarrow\emptyset\end{equation}
\begin{equation}1\ldots e\un{a}\to\to 1\ldots ba\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots a\un{b}\to\to 1\ldots ba\_\Rightarrow\emptyset,\{2\ldots\un{d}b\alpha\}\end{equation}
\begin{equation}1\ldots d\un{b}\to\to 2\ldots db\_\Rightarrow\emptyset,\{2\ldots \un{c}b\alpha\}\end{equation}
\begin{equation}1\ldots b\un{c}\to\to 2\ldots ab\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}1\ldots c\un{c}\to\to 2\ldots db\_\Rightarrow\emptyset,\{2\ldots\un{a}c\alpha\}\end{equation}
\begin{equation}1\ldots d\un{c}\to\to 2\ldots ab\_\Rightarrow\emptyset,\{2\ldots\un{c}c\alpha\}\end{equation}
\begin{equation}1\ldots d\un{c}\to\to 4\ldots ac\_\Rightarrow\emptyset,\{2\ldots\un{c}c\alpha\}\end{equation}
\begin{equation}1\ldots d\un{c}\to\to 4\ldots cc\_\Rightarrow\emptyset,\{2\ldots\un{c}c\alpha\}\end{equation}
\begin{equation}2\ldots a\un{b}\to\to 1\ldots bd\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}2\ldots d\un{b}\to\to 2\ldots ab\_\Rightarrow 5\ldots db\un{a}\to\to 3\ldots bcc,\emptyset\end{equation}
\begin{equation}2\ldots d\un{b}\to\to 2\ldots db\_\Rightarrow 5\ldots db\un{a}\to\to 5\ldots ccc,\emptyset\end{equation}
\begin{equation}2\ldots c\un{e}\to\to 3\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}2\ldots d\un{e}\to\to 2\ldots ab\_\Rightarrow 5\ldots de\un{a}\to\to 3\ldots bcc,\emptyset\end{equation}

\begin{equation}2\ldots d\un{e}\to\to 2\ldots db\_\Rightarrow 5\ldots de\un{a}\to\to 5\ldots ccc,\emptyset\end{equation}
\begin{equation}3\ldots a\un{b}\to\to 1\ldots bd\_\Rightarrow\left\{\begin{array}{l}
4\ldots ab\un{a}\to\to 3\ldots ecd\\2\ldots ab\un{e}\to\to 3\ldots eca\end{array}\right.,\left\{\begin{array}{l}5\ldots\un{c}b\alpha\\5\ldots\un{e}b\alpha\end{array}\right\}\end{equation}
\begin{equation}3\ldots d\un{b}\to\to 2\ldots ab\_\Rightarrow 5\ldots db\un{b}\to\to 3\ldots bcc,\emptyset\end{equation}
\begin{equation}3\ldots d\un{b}\to\to 2\ldots db\_\Rightarrow 5\ldots db\un{b}\to\to 5\ldots ccc,\emptyset\end{equation}
\begin{equation}3\ldots b\un{c}\to\to 2\ldots ab\_\Rightarrow \left\{\begin{array}{l}5\ldots bc\un{b}\to\to 3\ldots bcc\\
3\ldots ee\un{c}\to\to 1\ldots abc\_\\1\ldots ee\un{a}\to\to 1\ldots aba\_\\5\ldots ee\un{a}\to\to 3\ldots bcc\end{array}\right.,\{3\ldots\un{e}c\alpha\}\end{equation}
\begin{equation}3\ldots e\un{c}\to\to 1\ldots bc\_\Rightarrow 2\ldots ec\un{e}\to\to 4\ldots caa,\emptyset\end{equation}
\begin{equation}3\ldots e\un{c}\to\to 2\ldots ab\_\Rightarrow 5\ldots ec\un{b}\to\to 3\ldots bcc,\emptyset\end{equation}
\begin{equation}4\ldots c\un{a}\to\to 2\ldots db\_\Rightarrow\emptyset,\left\{\begin{array}{l}
3\ldots\un{a}a\alpha,2\ldots\un{d}c\alpha\end{array}\right\}\end{equation}
\begin{equation}4\ldots c\un{a}\to\to 4\ldots cb\_\Rightarrow\left\{\begin{array}{l}
5\ldots ca\un{d}\to\to 3\ldots abc\_\\1\ldots ca\un{b}\to\to 2\ldots aec\end{array}\right.,\left\{\begin{array}{l}3\ldots\un{a}a\alpha\\2\ldots\un{d}c\alpha\end{array}\right\}\end{equation}
\begin{equation}4\ldots d\un{a}\to\to 2\ldots ab\_\Rightarrow \emptyset,\emptyset\end{equation}
\begin{equation}5\ldots b\un{a}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots e\un{a}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots\un{b}\to\to 2\ldots b\_\Rightarrow \left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to 1\ldots bd\_\end{equation}
\begin{equation}5\ldots b\un{b}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots c\un{b}\to\to 2\ldots cb\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots c\un{b}\to\to 5\ldots ca\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots d\un{b}\to\to 2\ldots db\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots d\un{b}\to\to 3\ldots ab\_\Rightarrow\left.\begin{array}{l}3\ldots db\un{d}\\4\ldots db\un{d}\end{array}\right\}\to\to 3\ldots bca,\emptyset\end{equation}
\begin{equation}5\ldots d\un{b}\to\to 3\ldots cb\_\Rightarrow \left.\begin{array}{l}3\ldots db\un{d}\\4\ldots db\un{d}\end{array}\right\}\to\to 1\ldots abc\_,\emptyset\end{equation}
\begin{equation}5\ldots a\un{d}\to\to 1\ldots bc\_\Rightarrow\left.\begin{array}{l}3\ldots ad\un{d}\\4\ldots ad\un{d}\end{array}\right\}\to\to 4\ldots caa,\{4\ldots\un{e}d\alpha\}\end{equation}
\begin{equation}5\ldots d\un{d}\to\to 2\ldots ab\_\Rightarrow\emptyset,\emptyset\end{equation}

\begin{equation}5\ldots d\un{d}\to\to 4\ldots ac\_\Rightarrow\emptyset,\emptyset\end{equation}
\begin{equation}5\ldots d\un{d}\to\to 4\ldots cc\_\Rightarrow\emptyset,\emptyset\end{equation}






\subsubsection{The main list}
In this list, the IGR's are obtained by applying the context(s) to the original IGR's referred to if and only if the original IGR generates extendable IRR's, which happens if and only if the pointer is present in the notation as an underscore in its RHS. Thus for example, \eqref{set26.4} below is only $2\times 3$ IGR's instead of $3\times 3$, the IGR having the RHS $\ldots 2ab$ playing no role.
\begin{equation}\eqref{ex1}\text{ context }(ac,aa)\end{equation}
\begin{equation}\eqref{star}\text{ context }(ac,aa)\end{equation}
\begin{equation}1\un{d}ac\ldots\to\to 4\_caa\ldots\Rightarrow 2\un{a}dac\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}1\un{e}ac\ldots\to\to 4\_caa\ldots\Rightarrow 2\un{a}eac\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}\eqref{set26.3}\text{ context }(dc,ab)\end{equation}
\begin{equation}1\un{d}dc\ldots\to\to 4\_cab\ldots\Rightarrow 2\un{a}ddc\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}\eqref{star}\text{ context }(dc,ab)\end{equation}
\begin{equation}1\un{e}dc\ldots\to\to 4\_cab\ldots\Rightarrow 2\un{a}edc\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}\eqref{set26.3}\text{ context }(db,bd)\end{equation}
\begin{equation}1\un{d}db\ldots\to\to 4\_cbd\ldots\Rightarrow 2\un{a}ddb\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}\eqref{star}\text{ context }(db,bd)\end{equation}
\begin{equation}1\un{e}db\ldots\to\to 4\_cbd\ldots\Rightarrow 2\un{a}edb\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}\eqref{set25.4}\text{ context }(cb,cd)\text{ for }\gamma =d\end{equation}
\begin{equation}\eqref{set25.4}\text{ context }(cb,cd)\text{ for }\gamma =e\end{equation}
\begin{equation}\eqref{set25.4}\text{ context }(cc,ca)\text{ for }\gamma =d\end{equation}
\begin{equation}\eqref{set25.4}\text{ context }(cc,ca)\text{ for }\gamma =e\end{equation}









\begin{equation}5\un{c}aa\ldots\to\to 3dbc\ldots\Rightarrow 4\un{e}caa\ldots\to\to 3adbc\ldots\end{equation}
\begin{equation}\eqref{set6.3}\text{ context }(aa,ab)\end{equation}
\begin{equation}3\un{e}aa\ldots\to\to 4\_cab\ldots\Rightarrow 3\un{e}eaa\ldots\to\to 1babc\ldots\end{equation}
\begin{equation}3\un{e}aa\ldots\to\to 4\_cab\ldots\Rightarrow 4\un{c}eaa\ldots\to\to 2abdb\ldots\end{equation}
\begin{equation}\eqref{set6.3}\text{ context }(ed,ec)\end{equation}

\begin{equation}3\un{e}ed\ldots\to\to 4\_cec\ldots\Rightarrow 3\un{e}eed\ldots\to\to 1babc\ldots\end{equation}
\begin{equation}\label{ex9.5}\eqref{set30.4}\text{ context }(ed,ec)\end{equation}
\begin{equation}\eqref{set2.4}\text{ context }(d,c)\end{equation}
\begin{equation}4\un{b}bd\ldots\to\to 4\_cec\ldots\Rightarrow 4\un{b}bbd\ldots\to\to 1babc\ldots\end{equation}
\begin{equation}\eqref{set3.3}\text{ context }(bd,ec)\end{equation}
\begin{equation}\eqref{set3.4}\text{ context }(d,c)\end{equation}

\begin{equation}\eqref{set29.4}\text{ context }(e,c)\end{equation}


 

\begin{equation}\eqref{set1.4}\text{ context }(d,c)\end{equation}




\begin{equation}\eqref{set4.1}\text{ context }(e,c)\end{equation}
\begin{equation}\eqref{107.3}\text{ context }(de,cc)\end{equation}
\begin{equation}\eqref{107.3}\text{ context }(ee,cc)\end{equation}

\begin{equation}\eqref{set4.3}\text{ context }\begin{array}{l}(de,cc)\\(ee,cc)\end{array}\end{equation}







\begin{equation}5\un{c}ec\ldots\to\to 3\_bca\ldots\Rightarrow 4\un{e}cec\ldots\to\to 4cbcc\ldots\end{equation}
\begin{equation}5\un{e}ec\ldots\to\to 3\_bca\ldots\Rightarrow 4\un{e}eec\ldots\to\to 4cbcc\ldots\end{equation}
\begin{equation}4\un{b}ed\ldots\to\to 4\_cba\ldots\Rightarrow\left\{\begin{array}{l}4\un{b}bed\ldots\to\to 1babc\ldots\\3\un{a}bed\ldots\to\to 4abcc\ldots\end{array}\right.\end{equation}
\begin{equation}\eqref{set3.3}\text{ context }(ed,ba)\end{equation}
\begin{equation}\eqref{set4.4}\text{ context }(d,a)\end{equation}
\begin{equation}3\un{a}ed\ldots\to\to 2\_aba\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}aed\ldots\\5\un{e}aed\ldots\end{array}\right\}\to\to 4dbcc\ldots\\
4\un{c}aed\ldots\to\to 4abcc\ldots\\3\un{a}ebd\ldots\to\to 4abcc\ldots\end{array}\right.\end{equation}
\begin{equation}3\ldots bb\un{c}\to\to 4\ldots bcc\_\Rightarrow\left\{\begin{array}{l}
\left.\begin{array}{l}1\ldots ebd\un{c}\\5\ldots ebd\un{d}\end{array}\right\}\to\to 4\ldots bccc\_\\
4\ldots ebd\un{a}\to\to 4\ldots bccb\_\\
\left.\begin{array}{l}2\ldots ebd\un{e}\\2\ldots ebd\un{b}\\3\ldots ebd\un{b}\end{array}\right\}\to\to 3\ldots bccc\_\\
1\ldots ebd\un{b}\to\to 2\ldots bcdb\_\\
5\ldots ebd\un{b}\to\to 5\ldots bcca\_\end{array}\right.\end{equation}
\begin{equation}\eqref{set36.4}\text{ context }(bb,bc)\end{equation}
***********
\begin{equation}\eqref{set25.3}\text{ context }(a,c)\end{equation}

\begin{equation}5\ldots d\un{d}\to\to1\ldots bc\_\Rightarrow \left.\begin{array}{l}3\ldots dd\un{d}\\4\ldots dd\un{d}\end{array}\right\}\to\to4\ldots caa\end{equation}
\begin{equation}5\ldots b\un{b}\to\to 3\ldots cb\_\Rightarrow \left.\begin{array}{l}3\ldots bb\un{d}\\4\ldots bb\un{d}\end{array}\right\}\to\to 1\ldots abc\_\end{equation}

\begin{equation}4\ldots b\un{d}\to\to3\ldots aa\_\Rightarrow 1\ldots bd\un{b}\to\to1\ldots cbd\_\end{equation}


\begin{equation}5\ldots b\un{a}\to\to3\ldots ab\_\Rightarrow \left.\begin{array}{l}3\ldots ba\un{d}\\4\ldots ba\un{d}\end{array}\right\}\to\to 3\ldots bca\end{equation}
\begin{equation}5\ldots \beta\un{a}\to\to3\ldots cb\_\Rightarrow \left.\begin{array}{l}3\ldots\beta a\un{d}\\
4\ldots\beta a\un{d}\end{array}\right\}\to\to1\ldots abc\_\text{ for }\beta\in\{b,e\}\end{equation}
\begin{equation}5\ldots b\un{b}\to\to 3\ldots ab\_\Rightarrow\left.\begin{array}{l}3\ldots bb\un{d}\\4\ldots bb\un{d}\end{array}\right\}\to\to 3\ldots bca\end{equation}
\begin{equation}\eqref{set41.4}\text{ context }\begin{array}{l}(a,b)\\(d,b)\end{array}\end{equation}
\begin{equation}\eqref{set42.4}\text{ context }(b,a)\end{equation}
\begin{equation}\eqref{set43.4}\text{ context }(d,c)\end{equation}
\begin{equation}
4\ldots\beta\un{d}\to\to1\ldots bd\_\Rightarrow\left.\begin{array}{l}2\ldots \beta d\un{b}\\3\ldots\beta d\un{b}\end{array}\right\}\to\to3\ldots eca\text{ for }\beta\in\{a,d\}\end{equation}
\begin{equation}\eqref{set40.4}\text{ context }(b,a)\end{equation}
\begin{equation}\eqref{set20.3}\text{ context }\begin{array}{l}(b,b)\\(c,b)\\(d,b)\end{array}\end{equation}

\begin{equation}4\ldots b\un{a}\to\to3\ldots bc\_\Rightarrow\left.\begin{array}{l}3\ldots bd\un{d}\\4\ldots bd\un{d}\end{array}\right\}\to\to2\ldots bab\_\end{equation}

\begin{equation}\eqref{set38.4}\text{ context }(b,a)\end{equation}
\begin{equation}\eqref{set39.4}\text{ context }(d,c)\end{equation}
\begin{equation}3\ldots\beta\un{d}\to\to1\ldots bd\_\Rightarrow\left\{\begin{array}{l}4\ldots\beta d\un{a}\to\to3\ldots ecd\\2\ldots \beta d\un{e}\to\to3\ldots eca\end{array}\right.\text{ for }\beta\in\{a,d\}\end{equation}
\begin{equation}3\ldots b\un{d}\to\to3\ldots aa\_\Rightarrow 4\ldots bd\un{a}\to\to3\ldots cbc\_\end{equation}

\begin{equation}3\ldots b\un{c}\to\to4\ldots cc\_\Rightarrow\left\{\begin{array}{l}
3\ldots ee\un{c}\to\to3\ldots abc\_\\
1\ldots ee\un{a}\to\to2\ldots cdb\_\\
5\ldots ee\un{a}\to\to5\ldots cca\_\end{array}\right.\end{equation}
\begin{equation}\eqref{set36.4}\text{ context }\begin{array}{l}(b,c)\\(e,c)\\(b,a)\end{array}\end{equation}
\begin{equation}3\ldots e\un{c}\to\to 4\ldots cc\_\Rightarrow 1\ldots ec\un{c}\to\to 3\ldots abc\_\end{equation}
\begin{equation}\eqref{set37.4}\text{ context }\begin{array}{l}(a,b)\\(d,b)\end{array}\end{equation}

\begin{equation}3\ldots b\un{c}\to\to 1\ldots bc\_\Rightarrow\left\{\begin{array}{l}
2\ldots bc\un{e}\to\to 4\ldots caa\\
3\ldots ee\un{c}\to\to 2\ldots bdb\_\\
1\ldots ee\un{a}\to\to 2\ldots bcb\_\\
5\ldots ee\un{a}\to\to 2\ldots bcb\_\end{array}\right..\end{equation}
\begin{equation}3\ldots b\un{c}\to\to4\ldots ac\_\Rightarrow\left\{\begin{array}{l}1\ldots bc\un{c}\to\to 3\ldots dbc\_\\3\ldots ee\un{c}\to\to3\ldots dbc\_\\
1\ldots ee\un{a}\to\to2\ldots adb\_\\
5\ldots ee\un{a}\to\to5\ldots aca\_\end{array}\right.\end{equation}
\begin{equation}\eqref{set18.3}\text{ for }\beta = b \text{ context }(a,a)\end{equation}

\begin{equation}\eqref{set16.3}\text{ context }(a,b)\end{equation}
\begin{equation}3\ldots a\un{b}\to\to 2\ldots ab\_\Rightarrow 5\ldots ab\un{b}\to\to 3\ldots bcc\end{equation}

\begin{equation}3\ldots d\un{b}\to\to 1\ldots bd\_\Rightarrow\left\{\begin{array}{l}4\ldots db\un{a}\to\to3\ldots ecd\\2\ldots db\un{e}\to\to 3\ldots eca\end{array}\right.\end{equation}
\begin{equation}\eqref{set35.4}\text{ context }(b,b)\end{equation}
\begin{equation}\eqref{set33.4}\text{ context }\begin{array}{l}(b,b)\\(c,b)\\(d,b)\end{array}\end{equation}

\begin{equation}2\ldots b\un{e}\to\to2\ldots ab\_\Rightarrow 5\ldots be\un{a}\to\to 3\ldots bcc\end{equation}
\begin{equation}2\ldots b\un{e}\to\to2\ldots db\_\Rightarrow 5\ldots be\un{a}\to\to5\ldots ccc\end{equation}
\begin{equation}\eqref{set34.4}\text{ context }(d,b)\end{equation}

\begin{equation}\eqref{set31.4}\text{ context }(d,b)\end{equation}
\begin{equation}\eqref{set14.3}\text{ context }(a,a)\end{equation}

\begin{equation}2\ldots a\un{b}\to\to 2\ldots ab\_\Rightarrow 5\ldots ab\un{a}\to\to 3\ldots bcc\end{equation}
\begin{equation}\eqref{set13.3}\text{ for }\beta = b\text{ context }(a,b)\end{equation}
\begin{equation}\eqref{set32.4}\text{ context }\begin{array}{l}(b,a)\\(b,d)\end{array}\end{equation}

\begin{equation}\eqref{set3.3}\text{ context }(b,e)\end{equation}
\begin{equation}3\un{a}b\ldots\to\to 2\_ae\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}ab\ldots\\5\un{e}ab\ldots\end{array}\right\}\to\to 5\_ccc\ldots\\
4\un{c}ab\ldots\to\to 3\_bcc\ldots\end{array}\right.\end{equation}
\begin{equation}3\un{e}e\ldots\to\to 4\_ce\ldots\Rightarrow\left\{\begin{array}{l}3\un{e}ee\ldots\to\to 3bcb\ldots\\4\un{c}ee\ldots\to\to 3\_bcc\ldots\end{array}\right.\end{equation}
\begin{equation}4\un{b}b\ldots\to\to 4\_ce\ldots\Rightarrow\left\{\begin{array}{l}4\un{b}bb\ldots\to\to 3bcb\ldots\\3\un{a}bb\ldots\to\to 3\_bcc\ldots\end{array}\right.\end{equation}
\begin{equation}4\un{b}e\ldots\to\to 4\_cb\ldots\Rightarrow \left\{\begin{array}{l}4\un{b}be\ldots\to\to 2bab\ldots\\3\un{a}be\ldots\to\to 3abc\ldots\end{array}\right.\end{equation}
\begin{equation}\eqref{set30.4}\text{ context }(e,e)\end{equation}

\begin{equation}4\un{c}e\ldots\to\to2\_ae\ldots\Rightarrow 3\un{a}ce\ldots\to\to3\_bcc\ldots\end{equation}
This needs a derivation with the pointer going to $\alpha$ first
\begin{equation}4\un{c}e\ldots\to\to 2\_ae\ldots\Rightarrow\emptyset ,\emptyset\end{equation}
\begin{equation}\label{set11.4}5\un{\beta}e\ldots\to\to 3\_bc\ldots\Rightarrow 4\un{e}\beta e\ldots\to\to 5cba\ldots\text{ for }\beta\in\{c,e\}\end{equation}
\begin{equation}1\ldots b\un{a}\to\to 1\ldots ba\_\Rightarrow\emptyset\end{equation}
\begin{equation}1\ldots\beta\un{a}\to\to 2\ldots db\_\Rightarrow\emptyset\text{ for }\beta\in\{b,e\}\end{equation}
\begin{equation}1\ldots a\un{b}\to\to 2\ldots db\_\Rightarrow\emptyset\end{equation}
\begin{equation}1\ldots \beta\un{c}\to\to 1\ldots bc\_\Rightarrow\emptyset\text{ for }\beta\in\{b,c,d\}\end{equation}
\begin{equation}1\ldots b\un{c}\to\to 4\ldots cc\_\Rightarrow\emptyset\end{equation}



\begin{equation}3\un{a}e\ldots\to\to 2\_ab\ldots\Rightarrow \left\{\begin{array}{l}4\un{b}eb\ldots\to\to4\_cab\ldots\\
3\un{a}eb\ldots\to\to3abc\ldots\end{array}\right.\end{equation}

\begin{equation}\eqref{set6.3}\text{ context }\begin{array}{l}(a,a)\\(e,e)\end{array}\end{equation}
\begin{equation}3\un{e}a\ldots\to\to 4\_ca\ldots\Rightarrow\left\{\begin{array}{l}3\un{e}ea\ldots\to\to 4bcc\ldots\\4\un{c}ea\ldots\to\to 1abc\ldots\end{array}\right.\end{equation}


\begin{equation}\eqref{set4.3}\text{ context }(e,c)\end{equation}
\begin{equation}\eqref{set4.3}\text{ context }(d,c)\end{equation}
\begin{equation}\eqref{107.3}\text{ context }(\beta,c)\text{ for }\beta\in\{d,e\}\end{equation}

\begin{equation}3\un{a}b\ldots\to\to 2\_ae\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}ab\ldots\\5\un{e}ab\ldots\end{array}\right\}\to\to 5\_ccc\ldots\\
4\un{c}ab\ldots\to\to 3\_bcc\ldots\end{array}\right.\end{equation}

\begin{equation}1\un{\gamma}\beta\ldots\to\to 4\_ca\ldots\Rightarrow 2\un{a}\gamma\beta\to\to 1abc\ldots\text{ for }\beta\in\{a,d\}\text{ for }\gamma\in\{d,e\}\end{equation}

\begin{equation}1\un{\gamma} c\ldots\to\to 3\_ec\ldots\Rightarrow 2\un{d}\gamma c\ldots\to\to 3caa\ldots\text{ for }\gamma\in\{d,e\}.\end{equation} 

\begin{equation}\label{set4.1}1\un{\beta}d\ldots\to\to 4\_cb\ldots\Rightarrow 2\un{a}\beta d\ldots\to\to 3abc\ldots\text{ for }\beta\in\{d,e\}\end{equation}

\begin{equation}\label{set26.4}\eqref{set26.3}\text{ context }\begin{array}{l}(a,a)\\(d,a)\\(d,b)\end{array}\end{equation}
\begin{equation}\eqref{set25.4}\text{ context }(c,c)\end{equation}
\subsection{The list of results that generate the IRR(5)}
Applying the method again to the distinct right hand members of the above list of results gives the following that can be used to get all the members of IRR(5).
\begin{equation}1\un{\beta}\ldots\to\to 3\_e\ldots\Rightarrow\left\{\begin{array}{l}2\un{a}\beta\ldots\to\to 2\_ae\ldots\\2\un{c}\beta\ldots\to\to 5\_ce\ldots\end{array}\right.\text{ for }\beta\in\{d,e\}\text{ context }(aa,cc)\end{equation}\eqref{set25.4}
\begin{equation}1\un{\beta}aa\ldots\to\to 3\_ecc\ldots\Rightarrow 2\un{d}\beta aa\ldots\to\to 2cadb\ldots\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}1\un{\beta}\ldots\to\to 4\_c\ldots\Rightarrow\left\{\begin{array}{l}2\un{d}\beta\ldots\to\to 3\_bc\ldots\\2\un{c}\beta\ldots\to\to 5\_cc\ldots\end{array}\right.\text{ for }\beta\in\{d,e\}\text{ context }(ca,bc)\end{equation}cf\eqref{set26.3}\eqref{set27.4}
\begin{equation}1\un{d}aa\ldots\to\to 3\_ecc\ldots\Rightarrow 2\un{d}daa\ldots\to\to 2cadb\ldots\end{equation}
\begin{equation}1\un{e}aa\ldots\to\to 3\_ecc\ldots\Rightarrow 2\un{d}eaa\ldots\to\to 2cadb\ldots\end{equation}
\begin{equation}1\un{\beta}ca\ldots\to\to 4\_cbc\ldots\Rightarrow 2\un{a}\beta ca\ldots\to\to 2abab\ldots\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}\label{set2.5}2\un{\beta}\ldots\to\to2\_a\ldots\Rightarrow \left.\begin{array}{l}1\un{d}\beta\ldots\\1\un{e}\beta\ldots\end{array}\right\}\to\to 4\_ca\ldots\text{ for }\beta\in\{a,d\}\text{ context }\begin{array}{l}(dc,ec)\\(ec,ec)\end{array}\end{equation}cf\eqref{set2.3}
\begin{equation}2\un{a}d\ldots \to\to 2\_ae\ldots\Rightarrow \left.\begin{array}{l}1\un{d}da\ldots\\1\un{e}da\ldots\end{array}\right\}\to\to 4\_cae\ldots\text{ context }(c,c)\end{equation}
\begin{equation}2\un{a}ec\ldots\to\to 2\_aec\ldots\Rightarrow \left\{\begin{array}{l}4\un{b}e\gamma d\ldots\to\to 4\_caec\ldots\\3\un{a}e\gamma d\ldots\to\to 3\_bccc\ldots\end{array}\right.\text{ for }\gamma\in\{c,e\}\end{equation}

\begin{equation}\label{107}2\un{c}\ldots\to\to5\_c\ldots\Rightarrow \left.\begin{array}{l}1\un{d}c\ldots\\1\un{e}c\ldots\end{array}\right\}\to\to3\_ec\ldots\text{ context }\begin{array}{l}(dc,ec)\\(ec,ec)\end{array}\end{equation}cf\eqref{107.3}
\begin{equation}2\un{c}d\ldots \to\to 5\_ce\ldots \Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}ad\ldots\\5\un{e}ad\ldots\\4\un{e}ec\ldots\\4\un{e}cc\ldots\end{array}\right\}\to\to 2\_ece\ldots\\
\left.\begin{array}{l}1\un{d}aa\ldots\\1\un{e}aa\ldots\\ 4\un{b}cd\ldots\\1\un{d}ab\ldots\\1\un{e}ab\ldots\\ 3\un{e}ad\ldots\end{array}\right\}\to\to 3\_ece\ldots\\
\left.\begin{array}{l}3\un{a}cd\ldots\\4\un{c}ad\ldots\end{array}\right\}\to\to5\_ccc\ldots\end{array}\right.\text{ context }(c,c)\end{equation}
\begin{equation}\label{set3.5}3\un{a}\ldots\to\to 2\_a\ldots\Rightarrow 3\un{e}a\ldots\to\to 4\_ca\ldots\text{ context }(cc,bc)\end{equation}cf\eqref{set3.3}\eqref{set3.4}
\begin{equation}3\un{a}\ldots\to\to 3\_b\ldots\Rightarrow \left\{\begin{array}{l}
3\un{e}a\ldots\to\to 4\_cb\ldots\\
4\un{c}a\ldots\to\to 2\_ab\ldots\end{array}\right.\text{ context }(ce,cc)\end{equation}
\begin{equation}3\un{a}cc\ldots\to\to 2\_abc\ldots\Rightarrow\left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}acc\ldots\\5\un{e}acc\ldots\end{array}\right\}\to\to 2dbab\ldots\\
4\un{c}acc\ldots\to\to 3ccbc\ldots\end{array}\right.\end{equation}


\begin{equation}3\un{a}ce\ldots\to\to 3\_bcc\ldots\Rightarrow \left.\begin{array}{l}5\un{c}ace\ldots\\5\un{e}ace\ldots\end{array}\right\}\to\to 2cbab\ldots\end{equation}

\begin{equation} 4\un{b}c\ldots\to\to 4\_cb\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}5\un{c}eb\ldots\\5\un{e}eb\ldots\\2\un{d}db\ldots\\2\un{d}eb\ldots\end{array}\right\}\to\to 3\_bcb\ldots\\
\left.\begin{array}{l}2\un{c}db\ldots\\2\un{c}eb\ldots\end{array}\right\}\to\to 5\_ccb\ldots\end{array}\right.
\text{ context }\begin{array}{l}(b,c)\\(c,c)\end{array}\end{equation}
\begin{equation}4\un{b}c\beta\ldots\to\to 4\_cbc\ldots\Rightarrow \left\{\begin{array}{l}
\left.\begin{array}{l}4\un{b}bc\beta\ldots\\4\un{e}eb\beta\ldots\end{array}\right\}\to\to 1babd\ldots\\
\left.\begin{array}{l}3\un{a}bc\beta\ldots\\2\un{a}db\beta\ldots\\2\un{a}eb\beta\ldots\\4\un{c}eb\beta\ldots\end{array}\right\}\to\to 2abab\ldots\\\end{array}\right.\text{ for }\beta\in\{b,c\}
\end{equation}
\begin{equation}4\un{b}cb\ldots\to\to 4\_cbc\ldots\Rightarrow \left\{\begin{array}{l}
4\un{b}bba\ldots\to\to 1babd\ldots\\
3\un{a}bba\ldots\to\to2abab\ldots\end{array}\right.\end{equation}
\begin{equation}4\un{b}c\ldots\to\to4\_ca\ldots\Rightarrow \left\{\begin{array}{l}\left.\begin{array}{l}2\un{d}\beta b\ldots\\5\un{c}eb\ldots\\5\un{e}eb\ldots\end{array}\right\}\to\to 3\_bca\ldots\\
2\un{c}\beta b\ldots\to\to 5\_cca\ldots\end{array}\right.\text{ for }\beta\in\{d,e\}\text{ context }(e,e)\end{equation}
\begin{equation}4\un{b}ce\ldots\to\to 4\_cae\ldots\Rightarrow\left\{\begin{array}{l}\left.\begin{array}{l}
4\un{b}bce\ldots\\3\un{e}ebe\ldots\end{array}\right\}\to\to 5bcca\ldots\\
\left.\begin{array}{l}3\un{a}bce\ldots\\4\un{c}ebe\ldots\\2\un{a}\beta be\ldots\end{array}\right\}\to\to 2abcb\ldots\end{array}\right.\text{ for }\beta\in\{d,e\}\end{equation}
\begin{equation}4\un{b}eb\ldots\to\to4\_cab\ldots\Rightarrow \left\{\begin{array}{l}4\un{b}beb\ldots\to\to 4bccb\ldots\\3\un{a}beb\ldots\to\to2abdb\ldots\end{array}\right.\end{equation}

\begin{equation}4\un{e}\ldots\to\to 2\_e\ldots\Rightarrow 4\un{b}e\ldots\to\to 4\_ce\ldots\text{ context }\begin{array}{l}(cc,cc)\\(ec,cc)\end{array}\end{equation}





\begin{equation}2\ldots \un{b}\to\to 1\ldots d\_\Rightarrow \left\{\begin{array}{l}3\ldots b\un{c}\to\to 2\ldots ab\_\\
1\ldots b\un{a}\to\to 2\ldots db\_\\
5\ldots b\un{a}\to\to 2\ldots db\_\end{array}\right.\text{ context }(ba,ab)\end{equation}

\begin{equation}2\ldots\un{b}\to\to2\ldots b\_\Rightarrow\left\{\begin{array}{l}3\ldots b\un{c}\to\to1\ldots bc\_\\
1\ldots b\un{a}\to\to1\ldots ba\_\end{array}\right.\text{ context }\begin{array}{l}(bd,ad)\\(dd,ca)\end{array}\end{equation}
\begin{equation}2\ldots bd\un{b}\to\to 2\ldots adb\_\Rightarrow 5\ldots bdb\un{a}\to\to 2\ldots eccc\end{equation}
\begin{equation}2\ldots dd\un{b}\to\to 2\ldots cab\_\Rightarrow 5\ldots ddb\un{a}\to\to 2\ldots abcc\end{equation}
\begin{equation}2\ldots\un{e}\to\to 2\ldots b\_\Rightarrow\left\{\begin{array}{l}3\ldots e\un{c}\to\to 1\ldots bc\_\\1\ldots e\un{a}\to\to 1\ldots ba\_\end{array}\right.\text{ context }\begin{array}{l}(bd,ad)\\(dd,ca)\end{array}\end{equation}
\begin{equation}2\ldots bd\un{e}\to\to 2\ldots adb\_\Rightarrow 5\ldots bde\un{a}\to\to 2\ldots eccc\end{equation}
\begin{equation}2\ldots\un{e}\to\to3\ldots c\_\Rightarrow\left\{\begin{array}{l}3\ldots e\un{c}\to\to 4\ldots cc\_\\1\ldots e\un{a}\to\to 2\ldots db\_\\5\ldots e\un{a}\to\to 3\ldots cb\_\end{array}\right.\text{ context }\begin{array}{l}(bc,cc)\\(ec,cc)\\(bc,ac)\end{array}\end{equation}\eqref{set13.3}

\begin{equation}
3\ldots\un{b}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}1\ldots b\un{c}\to\to 2\ldots ab\_\\
5\ldots b\un{b}\to\to2\ldots db\_\end{array}\right.\text{ context }(ba,ab)\end{equation}
\begin{equation}3\ldots\un{\beta}\to\to2\ldots b\_\Rightarrow \left\{\begin{array}{l}1\ldots \beta\un{c}\to\to 1\ldots bc\_\\
4\ldots \beta\un{a}\to\to 3\ldots bc\_\\
2\ldots \beta\un{e}\to\to1\ldots bd\_\end{array}\right.\text{ context }\begin{array}{l}(bd,ad)\\(dd,ca)\end{array}\text{ for }\beta\in\{b,c,d\}\end{equation} only $\beta =b$ needed so far

\begin{equation}3\ldots bd\un{b}\to\to 2\ldots adb\_\Rightarrow 5\ldots bdb\un{b}\to\to 2\ldots eccc\end{equation}
\begin{equation}3\ldots dd\un{b}\to\to 2\ldots cab\_\Rightarrow 5\ldots ddb\un{b}\to\to 2\ldots abcc\end{equation}
\begin{equation}3\ldots\un{c}\to\to 1\ldots c\_\Rightarrow\left\{\begin{array}{l}1\ldots c\un{c}\to\to 2\ldots db\_\\4\ldots c\un{a}\to\to 2\ldots db\_\\5\ldots c\un{b}\to\to 2\ldots cb\_\end{array}\right.\text{ context }(be,ab)\end{equation}
\begin{equation}3\ldots be\un{c}\to\to 1\ldots abc\_\Rightarrow 2\ldots bec\un{e}\to\to 3\ldots bcaa\end{equation}

\begin{equation}3\ldots b\un{c}\to\to 2\ldots ab\_\Rightarrow \left\{\begin{array}{l}1\ldots ee\un{c}\to\to 1\ldots abc\_\\1\ldots ee\un{a}\to\to 1\ldots aba\_\end{array}\right.\text{ context }(d,b)\end{equation}
\begin{equation}3\ldots db\un{c}\to\to 2\ldots bab\_\Rightarrow \left.\begin{array}{l}5\ldots dee\un{a}\\5\ldots dbc\un{b}\end{array}\right\}\to\to 4\ldots cbcc\end{equation}
\begin{equation}3\ldots\un{c}\to\to 2\ldots b\_\Rightarrow\left\{\begin{array}{l}1\ldots c\un{c}\to\to 1\ldots bc\_\\4\ldots c\un{a}\to\to 3\ldots bc\_\\2\ldots c\un{e}\to\to 1\ldots bd\_\end{array}\right.\text{ context }\begin{array}{l}(be,ba)\\(ce,ba)\\(de,ba)\\(db,ba)\\(ee,bd)\end{array}\end{equation}
\begin{equation}3\ldots\beta e\un{c}\to\to 2\ldots bab\_\Rightarrow 5\ldots \beta ec\un{b}\to\to 4\ldots cbcc\text{ for }\beta\in\{b,c,d\}\end{equation}
\begin{equation}3\ldots ce\un{c}\to\to 2\ldots bdb\_\Rightarrow 5\ldots eec\un{b}\to\to 3\ldots eccc\end{equation}
\begin{equation}3\ldots ee\un{c}\to\to 2\ldots bdb\_\Rightarrow 5\ldots eec\un{b}\to\to 3\ldots eccc\end{equation}
\begin{equation}3\ldots \un{c}\to\to 3\ldots c\_\Rightarrow\left\{\begin{array}{l}1\ldots c\un{c}\to\to 4\ldots cc\_\\
4\ldots c\un{a}\to\to 2\ldots ab\_\\
2\ldots c\un{e}\to\to 2\ldots ab\_\\
5\ldots c\un{b}\to\to 3\ldots cb\_\end{array}\right.\text{ context }\begin{array}{l}(ee,db)\\(ee,ab)\end{array}\end{equation}
\begin{equation}3\ldots\un{d}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}1\ldots d\un{c}\to\to2\ldots ab\_\\5\ldots d\un{b}\to\to 2\ldots db\_\end{array}\right.\text{ context }(bd,ab)\end{equation}
\begin{equation}3\ldots\un{d}\to\to 2\ldots b\_\Rightarrow\left\{\begin{array}{l}1\ldots d\un{c}\to\to 1\ldots bc\_\\4\ldots d\un{a}\to\to 3\ldots bc\_\\2\ldots d\un{e}\to\to 1\ldots bd\_\end{array}\right.\text{ context }(bd,ba)\end{equation}
\begin{equation}3\ldots\un{d}\to\to 1\ldots c\_\Rightarrow\left\{\begin{array}{l}1\ldots d\un{c}\to\to 2\ldots db\_\\4\ldots d\un{a}\to\to 2\ldots db\_\\
5\ldots d\un{b}\to\to 2\ldots cb\_\end{array}\right.\text{ context }\begin{array}{l}(ba,ab)\\(ea,ab)\end{array}\end{equation}
\begin{equation}3\ldots \gamma a\un{d}\to\to 1\ldots abc\_\Rightarrow 2\ldots\gamma ad\un{e}\to\to 3\ldots bcaa\text{ for }\gamma\in\{b,e\}\end{equation}
\begin{equation}3\ldots bd\un{d}\to\to 2\ldots bab\_\Rightarrow 5\ldots bdd\un{b}\to\to 4\ldots cbcc\end{equation}
\begin{equation}4\ldots \un{a}\to\to 2\ldots b\_\Rightarrow \left\{\begin{array}{l}5\ldots a\un{d}\to\to 1\ldots bc\_\\
\left.\begin{array}{l}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}\right\}\to\to 1\ldots bd\_\\1\ldots a\un{b}\to\to 1\ldots ba\_\end{array}\right.\text{ context }\begin{array}{l}(bc,bd)\\(dd,ca)\end{array}\end{equation}
\begin{equation}4\ldots\un{a}\to\to 4\ldots b\_\Rightarrow \left.\begin{array}{l}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}\right\}\to\to 3\ldots bc\_\text{ context }\begin{array}{l}(bc,cc)\\(ec,cc)\\(bc,ac)\end{array}\end{equation}
\begin{equation}4\ldots c\un{a}\to\to 4\ldots cb\_\Rightarrow 5\ldots ca\un{d}\to\to 3\ldots abc\_\text{ context }\begin{array}{l}(b,c)\\(e,c)\\(b,a)\end{array}\end{equation}
\begin{equation}4\ldots bc\un{a}\to\to 4\ldots ccb\_\Rightarrow 1\ldots bca\un{b}\to\to 3\ldots bccc\end{equation}
\begin{equation}4\ldots ec\un{a}\to\to 4\ldots ccb\_\Rightarrow 1\ldots eca\un{b}\to\to 3\ldots bccc\end{equation}
\begin{equation}4\ldots bc\un{a}\to\to 4\ldots acb\_\Rightarrow 1\ldots bca\un{b}\to\to 5\ldots cccc\end{equation}
\begin{equation}4\ldots \un{a}\to\to 3\ldots c\_\Rightarrow \left\{\begin{array}{l}5\ldots a\un{d}\to\to 4\ldots cc\_\\
\left.\begin{array}{l}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}\right\}\to\to 2\ldots ab\_\\1\ldots a\un{b}\to\to 2\ldots db\_\end{array}\right.\text{ context }(bd,cb)\end{equation}

\begin{equation}4\ldots\un{d}\to\to1\ldots d\_\Rightarrow\left\{\begin{array}{l}5\ldots d\un{d}\to\to2\ldots ab\_\\1\ldots d\un{b}\to\to2\ldots db\_\end{array}\right.\text{ context }(bd,ab)\end{equation}

\begin{equation}4\ldots\un{d}\to\to 2\ldots b\_\Rightarrow\left\{\begin{array}{l}5\ldots d\un{d}\to\to1\ldots bc\_\\
\left.\begin{array}{l}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}\right\}\to\to1\ldots bd\_\\
1\ldots d\un{b}\to\to1\ldots ba\_\end{array}\right.\text{ context }(bd,ba)\end{equation}\eqref{set21.3}
\begin{equation}5\ldots\un{a}\to\to2\ldots b\_\Rightarrow \left.\begin{array}{l}3\ldots a\un{d}\\4\ldots a\un{d}\end{array}\right\}\to\to 1\ldots bd\_\text{ context }\begin{array}{l}(ee,bc)\\(be,bd)\\\end{array}\end{equation}

\begin{equation}5\ldots db\un{a}\to\to2\ldots bdb\_\Rightarrow \left.\begin{array}{l}
3\ldots dba\un{d}\\4\ldots dba\un{d}\end{array}\right\}\to\to 1\ldots bdbd\_\end{equation}

\begin{equation}5\ldots\un{a}\to\to 5\ldots a\_\Rightarrow \left.\begin{array}{l}3\ldots a\un{d}\\4\ldots a\un{d}\end{array}\right\}\to\to 3\ldots aa\_\text{ context }\begin{array}{l}(ee,ac)\\(ee,cc)\\\end{array}\end{equation}

\begin{equation}5\ldots \un{b}\to\to2\ldots b\_\Rightarrow \left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to 1\ldots bd\_\text{ context }\begin{array}{l}(bc,bc)\\(db,bd)\\(ad,bd)\\(dd,bd)\end{array}\end{equation}
\begin{equation}5\ldots bd\un{b}\to\to 3\ldots aab\_\Rightarrow \left.\begin{array}{l}3\ldots bdb\un{d}\\4\ldots bdb\un{d}\end{array}\right\}\to\to 4\ldots cbcc\_\end{equation}
\begin{equation}5\ldots d\un{b}\to\to 3\ldots cb\_\Rightarrow \left.\begin{array}{l}3\ldots db\un{d}\\4\ldots db\un{d}\end{array}\right\}\to\to 1\ldots abc\_\text{ context }(c,c)\end{equation}

\begin{equation}5\ldots \un{b}\to\to 5\ldots a\_\Rightarrow \left.\begin{array}{l}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}\right\}\to\to 3\ldots aa\_\text{ context }\begin{array}{l}(bc,cc)\\(ec,cc)\\(bc,ac)\end{array}\end{equation}
\begin{equation}5\ldots ba\un{d}\to\to 1\ldots abc\_\Rightarrow \left.\begin{array}{l}3\ldots bad\un{d}\\4\ldots bad\un{d}\end{array}\right\}\to\to 3\ldots bcaa\end{equation}

\begin{equation}5\ldots \un{\beta}\to\to 2\ldots b\_\Rightarrow \left.\begin{array}{l}3\ldots \beta\un{d}\\4\ldots\beta\un{d}\end{array}\right\}\to\to 1\ldots bd\_\text{ for }\beta\in\{a,d\}\text{ context }\begin{array}{l}(ad,ba)\\(dd,ba)\end{array}\end{equation}\eqref{set22.3}

\begin{equation}5\ldots\un{d}\to\to4\ldots c\_\Rightarrow\left.\begin{array}{l}3\ldots d\un{d}\\4\ldots d\un{d}\end{array}\right\}\to\to3\ldots cc\_\text{ context }\begin{array}{l}(bd,aa)\\(dd,cc)\end{array}\end{equation}\eqref{set25.3}

%\left.\begin{array}{l}2\un{a}db\\2\un{a}eb\\4\un{c}eb\end{array}\right\}\to\to 2abab\ldots\\
%\left.\begin{array}{l}2\un{c}db\\2\un{c}eb\ldots\end{array}\right\}\to\to 5\_ccbc\ldots\end{array}\right.\text{ contexts }\begin{array}{l}(b,c)\\(c,c)\end{array}\end{equation}
\section{Counting the IRR(n) for each n derived from Table~\ref{irr_2r}}
\begin{verbatim}IRR(2-10): 55,78,163,291,702,1578,3958,9686,24631\end{verbatim}
Much of the above description treats an IRR is a triplet $A\to B\to C$ that might be abbreviated to get patterns that match many triplets. However IRR's in general are defined uniquely by the CS $B$ and from it $C$ is uniquely defined, but in general there are a set of CS's $A$ forming the origin of $B$ i.e. such that $A\in O_1(B)$. Thus many distinct triplets can be part of the same IRR with the same $B$ and $C$. These definitions work because if an IRR is a union of a set of triplets with the same $B$ and $C$, $F$ applied to the IRR is the union of $F$ applied to each individual triplet. This fact is obvious from the arguments leading up to Theorem~\ref{irr_ind_thm} and it was taken for granted
in Tables \ref{ind1} and~\ref{irr_2r} where the IRR outlines have been represented with a single origin in each case. Therefore for counting purposes, the results need to be grouped together with a common $B$ and $C$. To do this the key fact seems to be the following regardless of the number of origins of the IRR: from any IRR $X$ of length $n$ and symbol $\alpha$, a distinct IRR $F(X)$ of length $n+1$ is produced if the backward search leads to the reachability of the LHS (the middle member of an IRR triplet which does not usually have to mentioned explicitly) for that value of $\alpha$. Otherwise no $F(X)$ is produced.

From this it follows that
if in a set $S$ of two or more IRR($n$) outlines, the RHS is the same for each, then they in general represent a set of $r\in\text{IRR}(n)$ of which some might have at least two origins. Then for each such $r$ the set of $\alpha$ values is the union of the sets of $\alpha$ values for each IRR outline in $S$ (see results in Table~\ref{irr_2r} matching $r$), and this number is the number of IRR($n+1$) derived from $r$ according to Theorem~\ref{irr_ind_thm}. This can be used to establish sets of IRR outlines that represent the same IRR of types RL and RR (types LR and LL will be considered in the next section) with multiple origins, starting from the set of IRR(3) i.e. \eqref{irr3.36} to \eqref{irr3.63} and to define inductively the set of all IRR's of types RL and RR defined by the IGR's in Table~\ref{irr_2r}.

The first step is to verify that the following is the list of all the sets of IRR outlines corresponding to \eqref{irr3.36}-\eqref{irr3.63}. Note the multiple outlines corresponding to single IRR's that have multiple origins.
\begin{longtable}{lll}
\caption{Members of IRR(3) of types RL and RR and their corresponding sets of IRR outlines from Table~\ref{irr_2r}\label{corr}}\\
IRR(3) member&set of IRR outlines&multiplicity\\
\eqref{irr3.36}&$\{4,8\}$&1\\
\eqref{irr3.37}&$\{1,5\}$&1\\
\eqref{irr3.38}&$\{2,6\}$&2\\
\eqref{irr3.39}&$\{3,7\}$&1\\
\eqref{irr3.45_1}&$\{19,21\}$&1\\
\eqref{irr3.45_2}&$\{10,13\}$&1\\
\eqref{irr3.45_3}&$\{15,17\}$&1\\
\eqref{irr3.51}&$\{55,58\}$&1\\
\eqref{irr3.52_1}&$\{62,67\}$&1\\
\eqref{irr3.52_2}&$\{37\}$&1\\
\eqref{irr3.52_3}&$\{51\}$&1\\
\eqref{irr3.53}&$\{54,57\}$&1\\
\eqref{irr3.53}&$\{63,68\}$&1\\
\eqref{irr3.54_1}&$\{34\}$&1\\
\eqref{irr3.54_2}&$\{49\}$&1\\
\eqref{irr3.57}.1&$\{39\}$&1\\
\eqref{irr3.57}.2&$\{38\}$&1\\
\eqref{irr3.58}.1&$\{26\}$&1\\
\eqref{irr3.58}.2&$\{23\}$&1\\
\eqref{irr3.59}&$\{61,66\}$&1\\
\eqref{irr3.60}&$\{32\}$&1\\
\eqref{irr3.61}&$\{48\}$&1\\
\eqref{irr3.63}.1&$\{44\}$&1\\
\eqref{irr3.63}.2&$\{30\}$&1\\
\end{longtable}

For example the single IRR \eqref{irr3.36} corresponds to the set $S=\{4,8\}$, and it leads under $F$ (see Table~\ref{irr_2r}) to $\{19,21\}$, $\{11,14\}$ and $\{15,17\}$ which each correspond to single IRR's of length 4 corresponding to $\alpha=a,c,d$ respectively. Regardless of the length of the IRR corresponding to $\{4,8\}$ a similar argument could be made giving the same IRR outlines. This is the importance of using IRR outlines. As another example, a single IRR of length 3 corresponds to $\{32\}$, which leads to $\{62\}$, $\{67\}$, $\{37\}$ and $\{51\}$. The first two of these have the same value of $\alpha$ ($a$) so they represent the same IRR which is represented by $\{62,67\}$. Thus $\{32\}$ leads under $F$ to $\{62,67\},\{37\}$ and $\{51\}$. Likewise each IRR matching $\{32\}$ of length $n$, under $F$, will lead to 3 IRR's of length $n+1$ matching $\{62,67\},\{37\}$ and $\{51\}$. 
Collecting all these results, one application of $F$ gives the following
\begin{longtable}{lll}
\caption{\label{corr2.1}}\\
set of IRR outlines&set of sets of IRR outlines after $F$&Set of LHS states\\
representing an IRR($3$)&&\\
$\{1,5\}$&$\{19,21\},\{10,13\},\{15,17\}$&$1$\\
$\{2,6\}$&$\{20,22\},\{9,12\},\{16,18\}$&$1$\\
$\{3,7\}$&$\{19,21\},\{10,13\},\{15,17\}$&$1$\\
$\{4,8\}$&$\{19,21\},\{11,14\},\{15,17\}$&$1$\\
$\{10,13\}$&$\emptyset$&$2$\\
$\{15,17\}$&$\{2,6\}$&$2$\\
$\{19,21\}$&$\{4,8\}$&$2$\\
$\{23\}$&$\{59,64\},\{32\},\{47\}$&$4$\\
$\{26\}$&$\emptyset$&$4$\\
$\{30\}$&$\{61,66\},\{32\},\{48\}$&$5$\\
$\{32\}$&$\{62,67\},\{37\},\{51\}$&$4$\\
$\{34\}$&$\{62,67\},\{36\},\{50\}$&$3$\\
$\{37\}$&$\emptyset$&$3$\\
$\{38\}$&$\{40\},\{24\}$&$4$\\
$\{39\}$&$\emptyset$&$4$\\
$\{44\}$&$\{39\},\{26\}$&$5$\\
$\{48\}$&$\emptyset$&$4$\\
$\{49\}$&$\{42\},\{28\}$&$3$\\
$\{51\}$&$\emptyset$&$3$\\
$\{54,57\}$&$\emptyset$&$3$\\
$\{55,58\}$&$\emptyset$&$3$\\
$\{61,66\}$&$\emptyset$&$4$\\
$\{62,67\}$&$\{55,58\}$&$3$\\
$\{63,68\}$&$\emptyset$&$3$\\
\end{longtable}

Another application of $F$ to these results gives the following results:

\begin{longtable}{lll}
\caption{\label{corr3}}\\
set of IRR outlines&set of sets of IRR outlines after $F$&Set of LHS states\\
$\{2,6\}$&$\{20,22\},\{9,12\},\{16,18\}$&$2$\\
$\{4,8\}$&$\{19,21\},\{11,14\},\{15,17\}$&$2$\\
$\{9,12\}$&$\{1,5\}$&$1$\\
$\{10,13\}$&$\emptyset$&$1$\\
$\{11,14\}$&$\emptyset$&$1$\\
$\{15,17\}$&$\{2,6\}$&$1$\\
$\{16,18\}$&$\{2,6\}$&$1$\\
$\{19,21\}$&$\{4,8\}$&$1$\\
$\{20,22\}$&$\emptyset$&$1$\\
$\{24\}$&$\{60,65\},\{33\},\{46\}$&$4$\\
$\{26\}$&$\emptyset$&$5$\\
$\{28\}$&$\{60,65\},\{33\},\{46\}$&$3$\\
$\{32\}$&$\{62,67\},\{37\},\{51\}$&$\{4,5\}$\\
$\{36\}$&$\emptyset$&$3$\\
$\{37\}$&$\emptyset$&$4$\\
$\{39\}$&$\emptyset$&$5$\\
$\{40\}$&$\emptyset$&$4$\\
$\{42\}$&$\{41\},\{25\}$&$3$\\
$\{47\}$&$\{43\},\{27\}$&$4$\\
$\{48\}$&$\emptyset$&$5$\\
$\{50\}$&$\{43\},\{27\}$&$3$\\
$\{51\}$&$\emptyset$&$4$\\
$\{55,58\}$&$\emptyset$&$3$\\
$\{59,64\}$&$\{53,56\}$&$4$\\
$\{61,66\}$&$\emptyset$&$5$\\
$\{62,67\}$&$\{55,58\}$&$\{3,4\}$\\
\end{longtable}
In the following table are given all these results i.e. the sets of IRR outlines in Table~\ref{corr} and those obtained by repeatedly applying $F$ to these until closure i.e. any set of IRR outlines in column 2 are included in column 1. The set of LHS states for each IRR outline includes all that arise in this process.
\newpage
\begin{longtable}{lll}
\caption{Relations between sets of IRR outlines under F\label{irr_sets_l}}\\
Original set &Set of sets of &Set of LHS states\\
of IRR outlines&IRR outlines derived by $F$&\\
$\{1,5\}$&$\{19,21\},\{10,13\},\{15,17\}$&$\{1,2\}$\\
$\{2,6\}$&$\{20,22\},\{9,12\},\{16,18\}$&$\{1,2\}$\\
$\{3,7\}$&$\{19,21\},\{10,13\},\{15,17\}$&$\{1\}$\\
$\{4,8\}$&$\{19,21\},\{11,14\},\{15,17\}$&$\{1,2\}$\\
$\{9,12\}$&$\{1,5\}$&$\{1,2\}$\\
$\{10,13\}$&$\emptyset$&$\{1,2\}$\\
$\{11,14\}$&$\emptyset$&$\{1,2\}$\\
$\{15,17\}$&$\{2,6\}$&$\{1,2\}$\\
$\{16,18\}$&$\{2,6\}$&$\{1,2\}$\\
$\{19,21\}$&$\{4,8\}$&$\{1,2\}$\\
$\{20,22\}$&$\emptyset$&$\{1,2\}$\\
$\{23\}$&$\{59,64\},\{32\},\{47\}$&$\{4\}$\\
$\{24\}$&$\{60,65\},\{33\},\{46\}$&$\{4\}$\\
$\{25\}$&$\emptyset$&$\{3,4\}$\\
$\{26\}$&$\emptyset$&$\{3,4,5\}$\\
$\{27\}$&$\{61,66\},\{32\},\{48\}$&$\{3,4\}$\\
$\{28\}$&$\{60,65\},\{33\},\{46\}$&$\{3\}$\\
$\{29\}$&$\emptyset$&$\{3,4\}$\\
$\{30\}$&$\{61,66\},\{32\},\{48\}$&$\{5\}$\\
$\{31\}$&$\emptyset$&$\{4\}$\\
$\{32\}$&$\{62,67\},\{37\},\{51\}$&$\{3,4,5\}$\\
$\{33\}$&$\{62,67\},\{35\},\{52\}$&$\{3,4\}$\\
$\{34\}$&$\{62,67\},\{36\},\{50\}$&$\{3\}$\\
$\{35\}$&$\emptyset$&$\{3,4\}$\\
$\{36\}$&$\emptyset$&$\{3\}$\\
$\{37\}$&$\emptyset$&$\{3,4,5\}$\\
$\{38\}$&$\{40\},\{24\}$&$\{4\}$\\
$\{39\}$&$\emptyset$&$\{3,4,5\}$\\
$\{40\}$&$\emptyset$&$\{4\}$\\
$\{41\}$&$\emptyset$&$\{3,4\}$\\
$\{42\}$&$\{41\},\{25\}$&$\{3,4\}$\\
$\{43\}$&$\{39\},\{26\}$&$\{3,4\}$\\
$\{44\}$&$\{39\},\{26\}$&$\{5\}$\\
$\{45\}$&$\{40\},\{24\}$&$\{4\}$\\
$\{46\}$&$\{42\},\{29\}$&$\{3,4\}$\\
$\{47\}$&$\{43\},\{27\}$&$\{4\}$\\
$\{48\}$&$\emptyset$&$\{3,4,5\}$\\
$\{49\}$&$\{42\},\{28\},$&$\{3\}$\\
$\{50\}$&$\{43\},\{27\}$&$\{3\}$\\
$\{51\}$&$\emptyset$&$\{3,4,5\}$\\
$\{52\}$&$\emptyset$&$\{3,4\}$\\
$\{53,56\}$&$\{45\},\{31\}$&$\{4\}$\\
$\{54,57\}$&$\emptyset$&$\{3\}$\\
$\{55,58\}$&$\emptyset$&$\{3,4,5\}$\\
$\{59,64\}$&$\{53,56\}$&$\{4\}$\\
$\{60,65\}$&$\emptyset$&$\{3,4\}$\\
$\{61,66\}$&$\emptyset$&$\{3,4,5\}$\\
$\{62,67\}$&$\{55,58\}$&$\{3,4,5\}$\\
$\{63,68\}$&$\emptyset$&$\{3\}$\\
\end{longtable}
By drawing out the directed graph corresponding to Table~\ref{irr_sets_l} it is easy to show that it has 4 connected components (denoted by $C1$-$C4$ respectively), the first 11 rows of the following Table~\ref{res_l}, $\{54,57\}$,$\{63,68\}$, and the remaining nodes. The only non-trivial strongly connected component (SCC) $S1$ has a subset of the nodes of $C1$. A strongly connected component (SCC) of a directed graph is a subset of the nodes of the directed graph and its associated edges such that every node of the SCC is connected to every other node of the SCC, directly or indirectly in both directions, and no other nodes can be added to this subset and retain this property, thus every node in an SCC is in a cycle i.e. a path back to itself. Single nodes can constitute an SCC with or without an edge connecting it to itself, and every node of a directed graph is in an SCC containing it. A non-trivial SCC (NSCC) is an SCC containing more than one node.

The single NSCC implicit in the directed graph defined by Table~\ref{irr_sets_l} has been verified by implementing Tarjan's algorithm \cite{Tarjan's_paper} in the programming language D \cite{Tarjan's_algorithm}. It was very satisfying to implement this algorithm because of its elegance (and ease of programming in D) and speed to do a task that is rather awkward by hand.

The importance of cycles is that they show that there are an infinite number of IRR's and allow a recursive definition to be made which defines an infinite subset of the IRR's. Table~\ref{res_l} lists (1) each set (node) in Table~\ref{irr_sets_l}, (2) the SCC it is in except for the trivial cases (3) whether or not there is a path from the starting node to a node in $S1$, (4) ``order" which represents the order of derivation. This is the length of the longest path from the starting node to any node in $S1$ or a terminating node. 

Table~\ref{res_l} could presumably be obtained by an extension of Tarjan's algorithm for obtaining the SCC's from any directed graph. The other columns of Table~\ref{res_l} can be verified easily in any order such that ``order" is non-decreasing.
\newpage 
\begin{longtable}{lccl}
\caption{Resolution of the directed graph defined by Table~\ref{irr_sets_l}\label{res_l}}\\
set&SCC&$\to S1$&order\\
$\{1,5\}$&$S1$&\checkmark&1\\
$\{2,6\}$&$S1$&\checkmark&1\\
$\{3,7\}$&\ding{55}&\checkmark&1\\
$\{4,8\}$&$S1$&\checkmark&1\\
$\{9,12\}$&$S1$&\checkmark&1\\
$\{10,13\}$&\ding{55}&\ding{55}&0\\
$\{11,14\}$&\ding{55}&\ding{55}&0\\
$\{15,17\}$&$S1$&\checkmark&1\\
$\{16,18\}$&$S1$&\checkmark&1\\
$\{19,21\}$&$S1$&\checkmark&1\\
$\{20,22\}$&\ding{55}&\ding{55}&0\\
$\{23\}$&\ding{55}&\ding{55}&7\\
$\{24\}$&\ding{55}&\ding{55}&3\\
$\{25\}$&\ding{55}&\ding{55}&0\\
$\{26\}$&\ding{55}&\ding{55}&0\\
$\{27\}$&\ding{55}&\ding{55}&3\\
$\{28\}$&\ding{55}&\ding{55}&3\\
$\{29\}$&\ding{55}&\ding{55}&0\\
$\{30\}$&\ding{55}&\ding{55}&3\\
$\{31\}$&\ding{55}&\ding{55}&0\\
$\{32\}$&\ding{55}&\ding{55}&2\\
$\{33\}$&\ding{55}&\ding{55}&2\\
$\{34\}$&\ding{55}&\ding{55}&5\\
$\{35\}$&\ding{55}&\ding{55}&0\\
$\{36\}$&\ding{55}&\ding{55}&0\\
$\{37\}$&\ding{55}&\ding{55}&0\\
$\{38\}$&\ding{55}&\ding{55}&4\\
$\{39\}$&\ding{55}&\ding{55}&0\\
$\{40\}$&\ding{55}&\ding{55}&0\\
$\{41\}$&\ding{55}&\ding{55}&0\\
$\{42\}$&\ding{55}&\ding{55}&1\\
$\{43\}$&\ding{55}&\ding{55}&1\\
$\{44\}$&\ding{55}&\ding{55}&1\\
$\{45\}$&\ding{55}&\ding{55}&4\\
$\{46\}$&\ding{55}&\ding{55}&2\\
$\{47\}$&\ding{55}&\ding{55}&4\\
$\{48\}$&\ding{55}&\ding{55}&0\\
$\{49\}$&\ding{55}&\ding{55}&4\\
$\{50\}$&\ding{55}&\ding{55}&4\\
$\{51\}$&\ding{55}&\ding{55}&0\\
$\{52\}$&\ding{55}&\ding{55}&0\\
$\{53,56\}$&\ding{55}&\ding{55}&5\\
$\{54,57\}$&\ding{55}&\ding{55}&0\\
$\{55,58\}$&\ding{55}&\ding{55}&0\\
$\{59,64\}$&\ding{55}&\ding{55}&6\\
$\{60,65\}$&\ding{55}&\ding{55}&0\\
$\{61,66\}$&\ding{55}&\ding{55}&0\\
$\{62,67\}$&\ding{55}&\ding{55}&1\\
$\{63,68\}$&\ding{55}&\ding{55}&0\\
\end{longtable}
This in particular characterises the cycles that lead to infinite numbers of IRR's.
Now the numbers of IRR($n$) for a range of values of $n\ge 3$ can be found starting from each IRR outline in Table~\ref{corr} by repeatedly referring to Table~\ref{irr_sets_l} and totalling the results. Table~\ref{irr_counts_ex} following has the results starting from \eqref{irr3.36}.
\begin{longtable}{l|rrrrrrrr}
\caption{The number of IRR's of length n derived by repeated applications of IGR's in Table~\ref{irr_2r} starting from a single IRR matching $\{4,8\}$ of length 3.\label{irr_counts_ex}}\\
IRR&\multicolumn{8}{c}{n}\\
outline&3&4&5&6&7&8&9&10\\\hline
$\{1,5\}$&0&0&0&0&1&0&2&0\\
$\{2,6\}$&0&0&1&0&2&0&4&0\\
$\{3,7\}$&0&0&0&0&0&0&0&0\\
$\{4,8\}$&1&0&1&0&1&0&2&0\\
$\{9,12\}$&0&0&0&1&0&2&0&4\\
$\{10,13\}$&0&0&0&0&0&1&0&2\\
$\{11,14\}$&0&1&0&1&0&1&0&2\\
$\{15,17\}$&0&1&0&1&0&2&0&4\\
$\{16,18\}$&0&0&0&1&0&2&0&4\\
$\{19,21\}$&0&1&0&1&0&2&0&4\\
$\{20,22\}$&0&0&0&1&0&2&0&4\\\hline
Total&1&3&2&6&4&12&8&24\\
\end{longtable}
Similar calculations were done with the other IRR(3) starting points and totalled to give the following.
\begin{longtable}{l|rrrrrrrr}
\caption{The number of IRR's of length n derived by repeated applications of IGR's in Table~\ref{irr_2r} starting from all the IRR(3).\label{irr_counts_total_l}}\\
Starting&\multicolumn{8}{c}{n}\\
IRR outline&3&4&5&6&7&8&9&10\\\hline
$\{4,8\}$&1&3&2&6&4&12&8&24\\
$\{1,5\}$&1&3&2&6&4&12&8&24\\
$\{2,6\}\times 2$&2&6&4&12&8&24&16&48\\
$\{3,7\}$&1&3&2&6&4&12&8&24\\
$\{19,21\}$&1&1&3&2&6&4&12&8\\
$\{15,17\}$&1&1&3&2&6&4&12&8\\
order 0$\times 10$&10&0&0&0&0&0&0&0\\
$\{62,67\}$&1&1&0&0&0&0&0&0\\
$\{44\}$&1&2&0&0&0&0&0&0\\
$\{32\}$&1&3&1&0&0&0&0&0\\
$\{30\}$&1&3&3&1&0&0&0&0\\
$\{49\}$&1&2&5&5&3&0&0&0\\
$\{38\}$&1&2&3&5&3&0&0&0\\
$\{34\}$&1&3&3&5&3&1&0&0\\
$\{23\}$&1&3&6&8&5&4&5&3\\\hline
Total&25&36&37&58&46&73&69&139\\
\end{longtable}
The ``order" 0 is the set of 10 IRR(3) that gave no IRR with larger $n$ in Table~\ref{corr2.1}. The remaining results from $\{62,67\}$ onwards were done in increasing order of ``order". As an example starting from a single IRR in $\{30\}$ of length 3 gives under $F$, 3 members of IRR(4) one in each of $\{61,66\},\{32\},\{48\}$. Of these only $\{32\}$ gives further IRR's which are 3 members of IRR(5) one in each of $\{62,67\},\{37\},\{51\}$, and of these only the first entails a member of IRR(6) in $\{55,58\}$ which ends the derivation sequence. Thus the counts for IRR are 1,3,3,1, then zeros for $n=\text{3,4,5,6,\ldots}$ respectively. 

Similar calculations can be done for the mirror image results i.e. those with the $\ldots$ on the left (Table~\ref{irr_2r.2}).
Counting the IRR obtained from Table~\ref{irr_2r.2} could of course be done likewise. Table~\ref{RHSs} contains the RHS's listed as $RHS$ in Tables \ref{irr_2r} and \ref{irr_2r.2}.
\newpage
\begin{longtable}{l|lllll}
\caption{RHS's for the non-IRR($n+1$) triplets in Tables \ref{irr_2r} and \ref{irr_2r.2} i.e. where the
new origin does not justify reachability of the LHS.\label{RHSs}}\\
RHS of IRR($n$)&\multicolumn{5}{c}{symbol $\alpha$}\\
&$a$&$b$&$c$&$d$&$e$\\\hline
$2\_ab\ldots$&$3dbc\ldots$&$4\_cab\ldots$&$3abc\ldots$&$3cbc\ldots$&$3\_cab\ldots$\\
$2\_ae\ldots$&$5\_ccc\ldots$&$4\_cae\ldots$&$3\_bcc\ldots$&$1abd\ldots$&$3\_cae\ldots$\\
$2\_ec\ldots$&$1cbd\ldots$&$4\_cec\ldots$&$1dbd\ldots$&$1abd\ldots$&$3\_cec\ldots$\\
$3\_bc\ldots$&$3cbc\ldots$&$4\_cbc\ldots$&$2\_abc\ldots$&$5\_cbc\ldots$&$2bab\ldots$\\
$4\_ca\ldots$&$3\_bca\ldots$&$4bcc\ldots$&$1abc\ldots$&$5\_cca\ldots$&$4aac\ldots$\\
$4\_cb\ldots$&$3\_bcb\ldots$&$2bab\ldots$&$3abc\ldots$&$5\_ccb\ldots$&$3cbc\ldots$\\
$4\_ce\ldots$&$3\_bce\ldots$&$3bcb\ldots$&$3\_bcc\ldots$&$5\_cce\ldots$&$3aab\ldots$\\
$5\_cc\ldots$&$2\_ecc\ldots$&$3\_ecc\ldots$&$1dbd\ldots$&$4\_acc$&$1dbd\ldots$\\
$5\_ce\ldots$&$2\_ece\ldots$&$3\_ece\ldots$&$5\_ccc\ldots$&$4\_ace\ldots$&$5\_ccc\ldots$\\
$1\ldots ba\_$&$2\ldots bcb\_$&$4\ldots cbd$&$4\ldots cab$&$2\ldots bab\_$&$2\ldots bab\_$\\
$1\ldots bc\_$&$2\ldots bdb\_$&$2\ldots bdb\_$&$4\ldots caa$&$2\ldots bcb\_$&$2\ldots bcb\_$\\
$1\ldots bd\_$&$2\ldots bab\_$&$3\ldots ecd$&$3\ldots eca$&$2\ldots bdb\_$&$2\ldots bdb\_$\\
$2\ldots ab\_$&$1\ldots abc\_$&$3\ldots abc\_$&$1\ldots abd\_$&$1\ldots aba\_$&$3\ldots bcc$\\
$2\ldots cb\_$&$1\ldots cbc\_$&$3\ldots cbc\_$&$1\ldots cbd\_$&$1\ldots cba\_$&$1\ldots abd\_$\\
$2\ldots db\_$&$1\ldots dbc\_$&$3\ldots dbc\_$&$1\ldots dbd\_$&$1\ldots dba\_$&$5\ldots ccc$\\
$3\ldots aa\_$&$4\ldots aac\_$&$3\ldots cbc\_$&$2\ldots adb\_$&$1\ldots cbd\_$&$3\ldots aab\_$\\
$3\ldots bc\_$&$4\ldots bcc\_$&$2\ldots bab\_$&$2\ldots bab\_$&$2\ldots bdb\_$&$3\ldots bcb\_$\\
$4\ldots ac\_$&$3\ldots dbc\_$&$4\ldots acb\_$&$3\ldots acc\_$&$2\ldots adb\_$&$5\ldots aca\_$\\
$4\ldots cb\_$&$3\ldots abc\_$&$4\ldots cbb\_$&$3\ldots cbc\_$&$2\ldots aec$&$5\ldots cba\_$\\
$4\ldots cc\_$&$3\ldots abc\_$&$4\ldots ccb\_$&$3\ldots ccc\_$&$2\ldots cdb\_$&$5\ldots cca\_$\\
\end{longtable}
\subsection{Abbreviating the tables of IRR-generating rules}
Tables \ref{irr_2r} and \ref{irr_2r.2} have a lot of structure i.e. regularities that result directly from how they were obtained. In what follows use will be made of this, so I here explain this by means of a theorem with its proof.
\begin{Theorem}\label{groups}
In Tables \ref{irr_2r} and \ref{irr_2r.2} the rows can be put into groups such that the set of abbreviations of the origins of the IRR(n+1) for each member of the group are the same, and in this set, the symbol adjacent to the one with the pointer is the same ($sy2$) and the set of abbreviations of the origins of the IRR(n) for the group all have (1) the same state and (2) the same symbol at the pointer which is also $sy2$.
\end{Theorem}
\begin{proof}
In this proof, $st$ and $sy$ with subscripts will stand for a state and a symbol respectively. As usual, $\alpha$ represents an arbitrary symbol that plays the role of $\alpha$ in the proof of Theorem~\ref{irr_ind_thm}. The proof as written is for the case where the arbitrary symbols $\ldots$ are on the right (Table~\ref{irr_2r}). It can be adapted to the other case by reversing the strings of symbols everywhere. 
 
Consider the set of abbreviated origins $S$ of IRR($n$) that lead to the abbreviated origin $st_1\un{sy_1}sy_2\ldots$ of IRR($n+1$) in Table~\ref{irr_2r} for a particular value of $\alpha$. They are obtained by a single forward TM step in each case (but complicated by the abbreviation). Therefore members of $S$ can be obtained from $st_1\un{sy_1}sy_2\ldots$ using \eqref{1}, so $sy_2$ is unaffected and must appear in each member of $S$ at the pointer because the TM is going right in this case. Thus forward computation by 1 step from $st_1\un{sy_1}sy_2\ldots$ must match each member of $S$ and in general $S$ is in $\{st_2 \un{sy_2}sy_{3i}\ldots\}_{i=1}^k$ for some integer $k$ where $i$ indexes the groups mentioned above, and $st_1\un{sy_1}$ leads under 1 TM step to state $st_2$.
Now we need to find all the origins of IRR($n+1$), i.e. what leads to $ st_2\alpha \un{sy_2}sy_{3i}\ldots$ which is $x = st_3 \un{sy_4}sy_2sy_{3i}\ldots$ where say $st_2\alpha\_\leftarrow st_3\un{sy_4}$. For each such pair $(st_3,sy_4)$ the result is shortened to length 2 as $st_3\un{sy_4}sy_2\ldots$, which is independent of $i$.
\end{proof}

For example $S=\{1\un{d}a\ldots,1\un{d}c\ldots,1\un{d}d\ldots\}$ as abbreviated origins of IRR($n$) give rise to the abbreviated origin $2\un{d}d\ldots$ in IRR($n+1$) for $\alpha = a$, (which arises from $1\alpha\un{d}a\ldots \leftarrow 2\un{d}da\ldots$, $1\alpha\un{d}c \leftarrow 2\un{d}dc\ldots$ and $1\alpha\un{d}d\ldots \leftarrow 2\un{d}dd\ldots$ for $\alpha = a$ which are each shortened to $2\un{d}d\ldots$ in Table~\ref{irr_2r}), then with $\alpha = c$ likewise with the same set $S$ of abbreviated origins for IRR($n$) we get $1\alpha\un{d}a\ldots \leftarrow 2\un{a}da\ldots,1\alpha\un{d}c \leftarrow 2\un{a}dc\ldots,1\alpha\un{d}d\ldots \leftarrow 2\un{a}dd\ldots$ which are all shortened to $2\un{a}d\ldots$ as the corresponding abbreviated origin in IRR($n+1$) etc.. This fact allows the table of the relationships between the derived origin (in IRR($n+1$)) and the original origins (in IRR($n$)) to be written succinctly as follows, where the incidence matrix has a 1 indicating each possible combination of RHS of IRR($n$) and $\beta$, and a zero where this combination does not occur.
%\newpage
\fontsize{10}{10}\selectfont
\begin{longtable}{lc|lllll|c}
%\renewcommand*{\arraystretch}{1.2}
\caption{Origins of IRR($n+1$) derived from origins of IRR($n$) and $\alpha$, and exceptions for $\beta$\label{origins_2}}\\
Origins and&$\beta$ and &\multicolumn{5}{c|}{Origins of IRR($n+1$) for symbol $\alpha$}&\\
RHS's of IRR($n$)&incidence matrix&$a$&$b$&$c$&$d$&$e$&$\beta$\\\hline

$\begin{array}{l}1\un{d}\beta\ldots\\\hline3\_ec\ldots\\4\_ca\ldots\\4\_cb\ldots\end{array}$&$\begin{array}{lll}a&c&d\\\hline0&1&0\\1&0&1\\0&0&1\end{array}$&$\begin{array}{@{}l@{}}2\un{d}d\ldots\end{array}$&&$\begin{array}{@{}l@{}}2\un{a}d\ldots\end{array}$&$\begin{array}{@{}l@{}}2\un{c}d\ldots\end{array}$&\\\hline
$\begin{array}{l}1\un{e}\beta\ldots\\\hline 3\_ec\ldots\\4\_ca\ldots\\4\_cb\ldots\end{array}$&$\begin{array}{lll}a&c&d\\\hline 0&1&0\\1&0&1\\0&0&1\end{array}$&$\begin{array}{@{}l@{}}2\un{d}e\ldots\end{array}$&&$\begin{array}{@{}l@{}}2\un{a}e\ldots\end{array}$&$\begin{array}{@{}l@{}}2\un{c}e\ldots\end{array}$&\\\hline
$\begin{array}{l}2\un{a}\beta\ldots\\\hline2\_ae\ldots\end{array}$&$\begin{array}{ll}d&e\\\hline1&1\end{array}$&&$\begin{array}{@{}l@{}}1\un{d}a\ldots\\1\un{e}a\ldots\end{array}$&&&&$de$\\\hline
$\begin{array}{l}2\un{c}\beta\ldots\\\hline5\_cc\ldots\\5\_ce\ldots\end{array}$&$\begin{array}{ll}d&e\\\hline 1&1\\1&1\end{array}$&&$\begin{array}{@{}l@{}}1\un{d}c\ldots\\1\un{e}c\ldots\end{array}$&&&&$de$\\\hline
$\begin{array}{l}2\un{d}\beta\ldots\\\hline3\_bc\ldots\end{array}$&$\begin{array}{ll}d&e\\\hline 1&1\end{array}$&&$\begin{array}{@{}l@{}}1\un{d}d\ldots\\1\un{e}d\ldots\end{array}$&&&&$de$\\\hline
$\begin{array}{l}3\un{a}\beta\ldots\\\hline2\_ab\ldots\\2\_ae\ldots\\3\_bc\ldots\end{array}$&$\begin{array}{lll}b&c&e\\\hline 0&1&1\\1&0&0\\1&1&0\end{array}$&$\begin{array}{@{}l@{}}5\un{c}a\ldots\\5\un{e}a\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{e}a\ldots\end{array}$&$\begin{array}{@{}l@{}}4\un{c}a\ldots\end{array}$&&&$bce$\\\hline
$\begin{array}{l}3\un{e}\beta\ldots\\\hline 4\_ca\ldots\\4\_cb\ldots\\4\_ce\ldots\end{array}$&$\begin{array}{ll}a&e\\\hline 1&0\\1&0\\0&1\end{array}$&$\begin{array}{@{}l@{}}5\un{c}e\ldots\\5\un{e}e\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{e}e\ldots\end{array}$&$\begin{array}{@{}l@{}}4\un{c}e\ldots\end{array}$&&&$ae$\\\hline
$\begin{array}{l}4\un{b}\beta\ldots\\\hline4\_ca\ldots\\4\_cb\ldots\\4\_ce\ldots\end{array}$&$\begin{array}{lll}b&c&e\\\hline 0&1&0\\0&1&1\\1&0&1\end{array}$&&$\begin{array}{@{}l@{}}4\un{b}b\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{a}b\ldots\end{array}$&&&$c$\\\hline
$\begin{array}{l}4\un{c}\beta\ldots\\\hline 2\_ab\ldots\\2\_ae\ldots\\3\_bc\ldots\end{array}$&$\begin{array}{ll}a&e\\\hline 1&0\\0&1\\1&1\end{array}$&&$\begin{array}{@{}l@{}}4\un{b}c\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{a}c\ldots\end{array}$&&&$a$\\\hline
$\begin{array}{l}4\un{e}\beta\ldots\\\hline 2\_ec\ldots\end{array}$&$\begin{array}{ll}c&e\\\hline 1 & 1\end{array}$&&$\begin{array}{@{}l@{}}4\un{b}e\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{a}e\ldots\end{array}$&&&$c$\\\hline
$\begin{array}{l}5\un{c}\beta\ldots\\\hline 3\_bc\ldots\\5\_cc\ldots\end{array}$&$\begin{array}{ll}a&e\\\hline 0&1\\1&0\end{array}$&$\begin{array}{@{}l@{}}4\un{e}c\ldots\end{array}$&&&&&\\\hline
$\begin{array}{l}5\un{e}\beta\ldots\\\hline3\_bc\\5\_cc\end{array}$&$\begin{array}{ll}a&e\\\hline 0&1\\1&0\end{array}$&$\begin{array}{@{}l@{}}4\un{e}e\ldots\end{array}$&&&&&\\\hline
$\begin{array}{l}1\ldots\beta\un{a}\\\hline1\ldots ba\_\\1\ldots bd\_\\2\ldots db\_\end{array}$&$\begin{array}{ll}b&e\\\hline 1&1\\1&0\\1&1\end{array}$&&&&&\\\hline
$\begin{array}{l}1\ldots\beta\un{b}\\\hline 1\ldots ba\_\\1\ldots bd\_\\2\ldots cb\_\\2\ldots db\_\end{array}$&$\begin{array}{ll}a&d\\\hline1&1\\0&1\\0&1\\1&1\end{array}$&&&&&&$d$\\\hline
$\begin{array}{l}1\ldots \beta\un{c}\\\hline1\ldots bc\_\\2\ldots ab\_\\2\ldots db\_\\3\ldots bc\_\\4\ldots ac\_\\4\ldots cc\_\end{array}$&$\begin{array}{lll}b&c&d\\\hline 1&1&1\\1&0&1\\0&1&1\\0&1&1\\1&0&1\\1&0&1\end{array}$&&&&&&$cd$\\\hline
$\begin{array}{l}2\ldots \beta\un{b}\\\hline1\ldots bd\_\\2\ldots ab\_\\2\ldots db\_\\3\ldots bc\_\\3\ldots cc\_\end{array}$&$\begin{array}{ll}a&d\\\hline 1&1\\1&1\\0&1\\1&0\\0&1\end{array}$&$\begin{array}{@{}l@{}}3\ldots b\un{c}\end{array}$&&&$\begin{array}{@{}l@{}}1\ldots b\un{a}\end{array}$&$\begin{array}{@{}l@{}}5\ldots b\un{a}\end{array}$&\\\hline
$\begin{array}{l}2\ldots\beta\un{e}\\\hline1\ldots bd\_\\2\ldots ab\_\\2\ldots db\_\\3\ldots cc\_\end{array}$&$\begin{array}{lll}b&c&d\\\hline1&1&1\\1&0&1\\1&0&1\\0&1&1\end{array}$&$\begin{array}{@{}l@{}}3\ldots e\un{c}\end{array}$&&&$\begin{array}{@{}l@{}}1\ldots e\un{a}\end{array}$&$\begin{array}{@{}l@{}}5\ldots e\un{a}\end{array}$&$b$\\\hline
$\begin{array}{l}3\ldots \beta\un{b}\\\hline1\ldots bd\_\\2\ldots ab\_\\2\ldots db\_\\3\ldots bc\_\\3\ldots cc\_\end{array}$&$\begin{array}{ll}a&d\\\hline 1&1\\1&1\\0&1\\1&0\\0&1\end{array}$&$\begin{array}{@{}l@{}}1\ldots b\un{c}\end{array}$&$\begin{array}{@{}l@{}}4\ldots b\un{a}\end{array}$&$\begin{array}{@{}l@{}}2\ldots b\un{e}\end{array}$&&$\begin{array}{@{}l@{}}5\ldots b\un{b}\end{array}$&$a$\\\hline
$\begin{array}{l}3\ldots\beta\un{c}\\\hline1\ldots bc\_\\2\ldots ab\_\\4\ldots ac\_\\4\ldots cc\_\end{array}$&$\begin{array}{ll}b&e\\\hline1&1\\1&1\\1&0\\1&1\end{array}$&$\begin{array}{@{}l@{}}1\ldots c\un{c}\end{array}$&$\begin{array}{@{}l@{}}4\ldots c\un{a}\end{array}$&$\begin{array}{@{}l@{}}2\ldots c\un{e}\end{array}$&&$\begin{array}{@{}l@{}}5\ldots c\un{b}\end{array}$&$b$\\\hline
$\begin{array}{l}3\ldots\beta\un{d}\\\hline1\ldots bc\_\\1\ldots bd\_\\2\ldots ab\_\\3\ldots aa\_\\3\ldots cc\_\\4\ldots cc\_\end{array}$&$\begin{array}{lll}a&b&d\\\hline1&1&0\\1&1&1\\0&0&1\\0&1&0\\0&0&1\\0&1&0\end{array}$&$\begin{array}{@{}l@{}}1\ldots d\un{c}\end{array}$&$\begin{array}{@{}l@{}}4\ldots d\un{a}\end{array}$&$\begin{array}{@{}l@{}}2\ldots d\un{e}\end{array}$&&$\begin{array}{@{}l@{}}5\ldots d\un{b}\end{array}$&$ab$\\\hline
$\begin{array}{l}4\ldots\beta\un{a}\\\hline2\ldots ab\_\\2\ldots db\_\\3\ldots bc\_\\4\ldots cb\_\end{array}$&$\begin{array}{lll}b&c&d\\\hline1&0&1\\0&1&1\\1&1&1\\0&1&1\end{array}$&$\begin{array}{@{}l@{}}5\ldots a\un{d}\end{array}$&&$\begin{array}{@{}l@{}}2\ldots a\un{b}\\3\ldots a\un{b}\end{array}$&$\begin{array}{@{}l@{}}1\ldots a\un{b}\end{array}$&&$bc$\\\hline
$\begin{array}{l}4\ldots \beta\un{d}\\\hline1\ldots bc\_\\1\ldots bd\_\\2\ldots ab\_\\3\ldots aa\_\\3\ldots cc\_\\4\ldots cc\_\end{array}$&$\begin{array}{lll}a&b&d\\\hline1&1&0\\1&1&1\\0&0&1\\0&1&0\\0&0&1\\0&1&0\end{array}$&$\begin{array}{@{}l@{}}5\ldots d\un{d}\end{array}$&&$\begin{array}{@{}l@{}}2\ldots d\un{b}\\3\ldots d\un{b}\end{array}$&$\begin{array}{@{}l@{}}1\ldots d\un{b}\end{array}$&&$b$\\\hline
$\begin{array}{l}5\ldots\beta\un{a}\\\hline2\ldots db\_\\3\ldots ab\_\\3\ldots cb\_\end{array}$&$\begin{array}{ll}b&e\\\hline1&1\\1&0\\1&1\end{array}$&&&$\begin{array}{@{}l@{}}3\ldots a\un{d}\\4\ldots a\un{d}\end{array}$&&&\\\hline
$\begin{array}{l}5\ldots\beta\un{b}\\\hline1\ldots bd\_\\2\ldots cb\_\\2\ldots db\_\\3\ldots ab\_\\3\ldots cb\_\\5\ldots ca\_\end{array}$&$\begin{array}{lll}b&c&d\\\hline0&1&0\\0&1&1\\1&0&1\\1&0&1\\1&0&1\\0&1&1\end{array}$&&&$\begin{array}{@{}l@{}}3\ldots b\un{d}\\4\ldots b\un{d}\end{array}$&&&\\\hline
$\begin{array}{l}5\ldots\beta\un{d}\\\hline1\ldots bc\_\\2\ldots ab\_\\2\ldots db\_\\3\ldots bc\_\\4\ldots ac\_\\4\ldots cc\_\end{array}$&$\begin{array}{ll}a&d\\\hline1&1\\0&1\\0&1\\1&1\\0&1\\1&1\end{array}$&&&$\begin{array}{@{}l@{}}3\ldots d\un{d}\\4\ldots d\un{d}\end{array}$&&&$a$\\\hline
\end{longtable}

\fontsize{12}{14}\selectfont

Table~\ref{origins_2} together with Table~\ref{origins_2_RHS} for the RHS's, being an abbreviation of tables \ref{irr_2r} and \ref{irr_2r.2}, is consistent with the closure property i.e. every abbreviated origin and RHS an IRR appearing on the right also appears on the left. The point of this is to ensure that every IRR that can be obtained from any member of IRR(3) by repeated applications of IGR's of length 2 are represented, together with the IGR's to generate them, in Tables~\ref{origins_2} and \ref{origins_2_RHS}. For example $2\un{d}d\ldots$ on the right in the first major row Table~\ref{origins_2} with $\alpha = a$ also appears on the left in the fifth major row with $\beta = d$. Also the RHS's associated with $2\un{d}d\ldots$ and $\alpha = a$ which are just $3\_bc$ as Table~\ref{origins_2_RHS} shows after applying $\alpha = a$ to $3\_ec\ldots$, $4\_ca\ldots$ and $4\_cb\ldots$ which are the RHS's in the first major row of Table~\ref{origins_2}, (ignoring the $3ca\ldots$ because it leads to an IRR of non-extendable type RR) is also the RHS of IRR($n$) in the fifth major row of Table~\ref{origins_2}.

\newpage
\fontsize{10}{10}\selectfont
\begin{longtable}{l|lllll}
\caption{RHS's of IRR($n+1$) derived from RHS's of IRR($n$) and $\alpha$\label{origins_2_RHS}}\\
&\multicolumn{5}{c}{RHS's of IRR($n+1$) for symbol $\alpha$}\\
RHS's of IRR($n$)&$a$&$b$&$c$&$d$&$e$\\\hline
$\begin{array}{l}2\_ab\ldots\end{array}$&$\begin{array}{@{}l@{}}3db\ldots\end{array}$&$\begin{array}{@{}l@{}}4\_ca\ldots\end{array}$&$\begin{array}{@{}l@{}}3ab\ldots\end{array}$\\
$\begin{array}{l}2\_ae\ldots\end{array}$&$\begin{array}{@{}l@{}}5\_cc\ldots\end{array}$&$\begin{array}{@{}l@{}}4\_ca\ldots\end{array}$&$\begin{array}{@{}l@{}}3\_bc\ldots\end{array}$\\
$\begin{array}{l}2\_ec\ldots\end{array}$&$\begin{array}{@{}l@{}}1cb\ldots\end{array}$&$\begin{array}{@{}l@{}}4\_ce\ldots\end{array}$&$\begin{array}{@{}l@{}}1db\ldots\end{array}$\\
$\begin{array}{l}3\_bc\ldots\end{array}$&$\begin{array}{@{}l@{}}3cb\ldots\end{array}$&$\begin{array}{@{}l@{}}4\_cb\ldots\end{array}$&$\begin{array}{@{}l@{}}2\_ab\ldots\end{array}$\\
$\begin{array}{l}3\_cb\ldots\end{array}$&$\begin{array}{@{}l@{}}2ca\ldots\end{array}$\\
$\begin{array}{l}3\_ec\ldots\end{array}$&$\begin{array}{@{}l@{}}3ca\ldots\end{array}$&&$\begin{array}{@{}l@{}}2\_ae\ldots\end{array}$&$\begin{array}{@{}l@{}}5\_ce\ldots\end{array}$\\
$\begin{array}{l}4\_ca\ldots\end{array}$&$\begin{array}{@{}l@{}}3\_bc\ldots\end{array}$&$\begin{array}{@{}l@{}}4bc\ldots\end{array}$&$\begin{array}{@{}l@{}}1ab\ldots\end{array}$&$\begin{array}{@{}l@{}}5\_cc\ldots\end{array}$\\
$\begin{array}{l}4\_cb\ldots\end{array}$&$\begin{array}{@{}l@{}}3\_bc\ldots\end{array}$&$\begin{array}{@{}l@{}}2ba\ldots\end{array}$&$\begin{array}{@{}l@{}}3ab\ldots\end{array}$&$\begin{array}{@{}l@{}}5\_cc\ldots\end{array}$\\
$\begin{array}{l}4\_ce\ldots\end{array}$&$\begin{array}{@{}l@{}}3\_bc\ldots\end{array}$&$\begin{array}{@{}l@{}}3bc\ldots\end{array}$&$\begin{array}{@{}l@{}}3\_bc\ldots\end{array}$\\
$\begin{array}{l}5\_cc\ldots\end{array}$&$\begin{array}{@{}l@{}}2\_ec\ldots\end{array}$&$\begin{array}{@{}l@{}}3\_ec\ldots\end{array}$\\
$\begin{array}{l}5\_ce\ldots\end{array}$&&$\begin{array}{@{}l@{}}3\_ec\ldots\end{array}$\\
$\begin{array}{l}1\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots aa\end{array}$&$\begin{array}{@{}l@{}}2\ldots cb\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots cb\_\end{array}$\\
$\begin{array}{l}1\ldots bd\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots cd\end{array}$&$\begin{array}{@{}l@{}}3\ldots ca\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$\\
$\begin{array}{l}2\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots bd\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots ba\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots cc\end{array}$\\
$\begin{array}{l}2\ldots cb\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots bc\_\end{array}$&&$\begin{array}{@{}l@{}}1\ldots bd\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots ba\_\end{array}$\\
$\begin{array}{l}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots bd\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots ba\_\end{array}$&$\begin{array}{@{}l@{}}5\ldots cc\end{array}$\\
$\begin{array}{l}3\ldots aa\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots ac\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}1\ldots bd\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots ab\_\end{array}$\\
$\begin{array}{l}3\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots bc\_\end{array}$&&$\begin{array}{@{}l@{}}3\ldots ca\end{array}$&&$\begin{array}{@{}l@{}}3\ldots bb\_\end{array}$\\
$\begin{array}{l}3\ldots cb\_\end{array}$&&&$\begin{array}{@{}l@{}}1\ldots bc\_\end{array}$\\
$\begin{array}{l}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots cc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots cb\_\end{array}$\\
$\begin{array}{l}3\ldots cc\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots cc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots ab\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots cb\_\end{array}$\\
$\begin{array}{l}4\ldots cb\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots ec\end{array}$\\
$\begin{array}{l}4\ldots ac\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots cb\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots cc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}5\ldots ca\_\end{array}$\\
$\begin{array}{l}4\ldots cc\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots bc\_\end{array}$&$\begin{array}{@{}l@{}}4\ldots cb\_\end{array}$&$\begin{array}{@{}l@{}}3\ldots cc\_\end{array}$&$\begin{array}{@{}l@{}}2\ldots db\_\end{array}$&$\begin{array}{@{}l@{}}5\ldots ca\_\end{array}$\\
$\begin{array}{l}5\ldots ca\_\end{array}$&&&$\begin{array}{@{}l@{}}3\ldots aa\_\end{array}$\\
\end{longtable}
\fontsize{12}{14}\selectfont

\fontsize{10}{10}\selectfont
\begin{longtable}{c|c}
\caption{Origins of IRR($n+1$) derived from origins of IRR($n$) for $k=2$ exceptions\label{exceptions_2}}\\
Origin of IRR($n$)&Origins of IRR($n+1$)\\
$2\alpha\un{a}d\ldots$&$1\alpha a\un{a}\ldots$\\
$2\alpha\un{a}e\ldots$&$5\alpha a\un{a}\ldots$\\
$2\alpha\un{c}d\ldots$&$1\alpha c\un{a}\ldots$\\
$2\alpha\un{c}e\ldots$&$5\alpha c\un{a}\ldots$\\
$2\alpha\un{d}d\ldots$&$1\alpha d\un{a}\ldots$\\
$2\alpha\un{d}e\ldots$&$5\alpha d\un{a}\ldots$\\
$3\alpha\un{a}b\ldots$&$4\alpha a\un{a}\ldots$\\
$3\alpha\un{a}c\ldots$&$2\alpha a\un{e}\ldots$\\
$3\alpha\un{a}e\ldots$&$5\alpha a\un{b}\ldots$\\
$3\alpha\un{e}a\ldots$&$1\alpha e\un{c}\ldots$\\
$3\alpha\un{e}e\ldots$&$5\alpha e\un{b}\ldots$\\
$4\alpha\un{b}c\ldots$&$2\alpha b\un{b}\ldots,3\alpha b\un{b}\ldots$\\
$4\alpha\un{c}a\ldots$&$5\alpha c\un{d}\ldots$\\
$4\alpha\un{e}c\ldots$&$2\alpha e\un{b}\ldots$,$3\alpha e\un{b}\ldots$\\
$1\ldots d\un{b}\alpha$&$2\ldots \un{c}b\alpha$\\
$1\ldots c\un{c}\alpha$&$2\ldots\un{a}c\alpha$\\
$1\ldots d\un{c}\alpha$&$2\ldots \un{c}c\alpha$\\
$2\ldots b\un{e}\alpha$&$1\ldots \un{d}e\alpha,1\ldots \un{e}e\alpha$\\
$3\ldots a\un{b}\alpha$&$5\ldots \un{c}b\alpha,5\ldots\un{e}b\alpha$\\
$3\ldots b\un{c}\alpha$&$3\ldots \un{e}c\alpha$\\
$3\ldots a\un{d}\alpha$&$5\ldots \un{c}d\alpha,5\ldots \un{e}d\alpha$\\
$3\ldots b\un{d}\alpha$&$3\ldots\un{e}d\alpha$\\
$4\ldots b\un{a}\alpha$&$4\ldots\un{b}a\alpha$\\
$4\ldots c\un{a}\alpha$&$3\ldots\un{a}a\alpha$\\
$4\ldots b\un{d}\alpha$&$4\ldots\un{b}d\alpha$\\
$5\ldots a\un{d}\alpha$&$4\ldots\un{e}d\alpha$\\
\end{longtable}
\fontsize{12}{14}\selectfont

\section{\label{sec4}Dealing with the exceptions}
In what follows, $IRR(n,k)$ is the set of all distinct abbreviations of members of IRR($n$) with $k<n$ symbols specified. The abbreviation is just truncation to leave the symbols closest to the pointer in the origin and showing the symbols in the same places in the RHS. The remaining deleted symbols are replaced by $\ldots$.

In order to overcome the restriction to $k=2$ symbols in the definition of Tables~\ref{origins_2} and \ref{origins_2_RHS}, a generalisation $t(k)$ to any number $k$ of specified symbols will be defined as follows. A member of IRR($n,k$) in $t(k)$ (first major column) is either a member of IRR($k+1,k$) or has been obtained by repeated applications of $F$ starting from member of IRR($k+1,k$) using one or more IGR's of length $k$ and truncating the result by one symbol for each IGR applied in order that the length of the strings of specified symbols remains equal to $k$. Each abbreviated non-IRR($n+1$) rule $Y$ in the rightmost major column in $t(k)$ i.e. with the pointer at the opposite end of the string from the $\alpha$ (an exception) is obtained from a corresponding member of IRR($n,k$) $X$. $t(k)$ is defined to have this property and is therefore obtained by a closure procedure which requires that every member of IRR($n+1,k$) in the rightmost major column also appears in the IRR($n$) column. In either case an extra symbol can be added to $X$ giving the full member of IRR($k+1$), or by not abbreviating by removing one symbol in the last step of the closure procedure. Then the computation of the new origin can be continued.

In Table~\ref{origins_3}, each origin of a member of IRR($n+1$) is an origin of a member of IRR($n+1$) in Table~\ref{origins_2} and is therefore an origin of a member of IRR($n$) in Table~\ref{origins_2}. For example every CS in $1\un{d}da\ldots$ in the first row of Table~\ref{origins_3} is also in $1\un{d}d\ldots$ (the third major row of Table~\ref{origins_2}). This implies that any IRR deduced using the IGR's in Table~\ref{origins_3} can be used by an IGR in Table~\ref{origins_2} to deduce another IRR. This needs to be generalised.

This procedure is complicated by the abbreviation of Table~\ref{irr_2r} for $k=2$ as Table~\ref{origins_2} with RHS's given in Table~\ref{origins_2_RHS} and the new origins for the exceptions given in Table~\ref{exceptions_2}, and corresponding abbreviations for all the $t(k)$ for $k>2$. Table~\ref{origins_2} is a data structure that seems to be minimal i.e. without repetition, and Tables\ref{origins_2}, \ref{origins_2_RHS} and \ref{exceptions_2}, and their extensions to higher values of $k$ should be used in an automated procedure for doing this. This explains the complexity of the method, which is described next using an example.

Continuing from the exceptions in Table~\ref{origins_2} to implement the next stage in applying
Theorem~\ref{irr_ind_thm} to the TM under study, consider the first IRR abbreviation with an exception in Table~\ref{origins_2} i.e. $A=2\un{a}d\ldots\to\to2\_ae\ldots$.
 In order to do this one more symbol on the right is needed. Going back to see the context in which this could arise, Table~\ref{origins_2} shows that it can arise via $F$ from $1\un{d}\beta\ldots\to\to RHS$ with $\alpha = c$, where $RHS\in\{3\_ec\ldots,4\_ca\ldots,4\_cb\ldots\}$ and $\beta\in\{a,c,d\}$, and 4 combinations of these are possible given by the incidence matrix. 
Then from Table~\ref{origins_2_RHS} with $\alpha = c$ and the RHS of IRR($n+1$) is $2\_ae\ldots$ which shows that the RHS of IRR($n$) is $3\_ec\ldots$ and finally from Table~\ref{origins_2} $\beta = c$, showing that $1\un{d}c\ldots\to\to3\_ec\ldots$ leads to $A$. Alternatively it is easy to show that, in the notation of \eqref{f_array} with one extra symbol in the abbreviated IRR on the right,
\begin{equation}\label{IGR_1}1\un{d}\ldots\to\to 3\_e\ldots\stackrel{c}{\Rightarrow}2\un{a}d\ldots\to\to2\_ae\ldots\end{equation} where the $\ldots$ represents the same string on the left of the $\to\to$ on both sides and similarly on the right. Because every IRR has a unique image under $F^{-1}$ (Theorem~\ref{irr_ind_thm}) it follows that this can be obtained in this case by using \eqref{IGR_1} i.e. the uniqueness of $F^{-1}$ for IRR's implies the uniqueness of $F^{-1}$ for the abbreviated IRR $2\un{a}d\ldots\to\to 2\_ae\ldots$ And because $1\un{d}\ldots\to\to 3\_e\ldots$ is only represented in Table~\ref{origins_2} by its subset $1\un{d}c\ldots\to\to 3\_ec\ldots$, this then is the only possible source of $A$ via $F$ in Table~\ref{origins_2}.

Now without deleting the extra symbol this derivation starts by applying the backward search algorithm as follows $1c\un{d}c\ldots\leftarrow 2\un{a}dc\ldots$ and forward computation $3\un{c}ec\ldots\to 2\_aec\ldots$ thus the extended version of $A$ is $2\un{a}dc\ldots\to\to2\_eac\ldots$.
Now returning to the original problem, applying $F$ to this starting with the backward searching algorithm gives 
\begin{equation}2\alpha\un{a}dc\ldots\left\{\begin{array}{l}\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}adc\ldots\\1\un{e}adc\ldots\end{array}\right.\\
\leftarrow 1\alpha a\un{a}c\ldots\leftarrow2\alpha\un{d}ac\ldots\left\{\begin{array}{l}\stackrel{\alpha = b}{\leftarrow}\left\{\begin{array}{l}1\un{d}dac\ldots\\1\un{e}dac\ldots\end{array}\right.\\
\leftarrow 3\alpha d\un{c}c\ldots\leftarrow 2\alpha dc\un{e}\ldots\end{array}\right.\end{array}\right.\end{equation}
The first two results for $\alpha = b$ are nothing new and can be found in Table~\ref{origins_2}, bearing in mind that the $c$ is not involved so can be omitted. The result $2\alpha\un{a}dc\ldots\leftarrow 1\alpha a\un{a}c\ldots$ found in Table~\ref{exceptions_2} can now be extended as shown, and the first two of these results are in the first row of Table~\ref{origins_3} after truncation to $k=3$ symbols. Combining this with the result on the third row of Table~\ref{RHS_update_3} with $\alpha = b$ shows that the derived abbreviated IRR's are $1\un{d}da\ldots\to\to 4\_cae\ldots$ and $1\un{e}da\ldots\to\to 4\_cae\ldots$ Again there is an exception i.e. $2\alpha\un{a}dc\ldots\leftarrow 2\alpha dc\un{e}\ldots$ which appears in the second row of Table~\ref{exceptions_3}.

The general procedure is, starting from $A=O1\to\to R1\in IRR(n,k)$ find $O2\to\to R2\in IRR(n,k)$ which gives rise to it in $t(k)$, its extension $A'=O3\to\to R3\in IRR(n,k+1)$ and finally the application of $F$ to $A'$ as follows:
\begin{enumerate}
\item Look up $O1$ in the second major column of $t(k)$ to find $\alpha$, the new origin $O2$ in the left major column of $t(k)$, RHS's $R2$, $\beta$ and the incidence matrix.
\item From $\alpha$ and $R2$ combined, take the computation forward to give $R3$, the subset of these results that are consistent with, i.e subsets of, $R1$, if any.
\item If there are any such $R3$'s, for each case for the corresponding $R2$ and set of values of $\beta$ from the incidence matrix, combine $\alpha$ and the values of $\beta$ and $O2$ to give the set of CS's $Y$. For each such CS $Y$, carry out the backward search algorithm to obtain $O3$ such that it is a subset of i.e. compatible with $O1$ giving $A'=O3\to\to R3\in IRR(n,k+1)$ which is an extension of $A$, otherwise stop because there are no results.
\item Apply $F$ to $A'$ by starting the backward search from the original end point giving new abbreviated origins if any, RHS's i.e. members of $IRR(n+1,k+1)$ and exceptions where the pointer goes away from the $\alpha$, if any.
\end{enumerate}
A further practical complication is that it is quicker to carry out these calculations for the same $O1$ with different $R1$s (this is possible because of different symbols that are abbreviated in $\ldots$) together, rather than doing them all separately because the calculations with the $O1$ are the same. 




\fontsize{10}{10}\selectfont


\begin{longtable}{lc|ccccc|l}
\caption{Origins of IRR($n+1$) derived from origins of IRR($n$) and $\alpha$, and exceptions for $\beta$\label{origins_3}}\\
Origins and&$\beta$ and &\multicolumn{5}{c|}{Origins of IRR($n+1$) for symbol $\alpha$}&\\
RHS's of IRR($n$)&incidence matrix&$a$&$b$&$c$&$d$&$e$&$\beta$\\\hline
$\begin{array}{l}2\un{a}d\beta\ldots\\\hline2\_aec\ldots\end{array}$&$\begin{array}{ll}b&c\\\hline 1&1\end{array}$&&
$\begin{array}{@{}l@{}}1\un{d}da\ldots\\1\un{e}da\ldots\end{array}$&&&&$bc$\\\hline
$\begin{array}{l}2\un{a}e\beta\ldots\\\hline2\_aec\ldots\end{array}$&$\begin{array}{ll}b&c\\\hline1&1\end{array}$&&$\begin{array}{@{}l@{}}4\un{b}ea\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{a}ea\ldots\\\end{array}$&&&$c$\\\hline
$\begin{array}{l}2\un{c}d\beta\ldots\\\hline5\_cca\ldots\\5\_ccb\ldots\\5\_cec\ldots\\\end{array}$&$\begin{array}{llll}a&b&c&d\\\hline1&1&0&1\\0&1&0&1\\0&1&1&0\\\end{array}$&$\begin{array}{@{}l@{}}4\un{e}cc\ldots\\4\un{e}ec\ldots\\5\un{c}ad\ldots\\5\un{e}ad\ldots\end{array}$&$\begin{array}{@{}l@{}}1\un{d}aa\ldots\\1\un{d}ab\ldots\\1\un{e}aa\ldots\\1\un{e}ab\ldots\\3\un{e}ad\ldots\\4\un{b}cd\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{a}cd\ldots\\4\un{c}ad\ldots\end{array}$&&&$abcd$\\\hline
$\begin{array}{l}2\un{c}e\beta\ldots\\\hline5\_cca\ldots\\5\_ccb\ldots\\5\_cec\ldots\end{array}$&$\begin{array}{llll}a&b&c&d\\\hline1&1&0&1\\0&1&0&1\\0&1&1&0\end{array}$&&&&&\\\hline
$\begin{array}{l}2\un{d}d\beta\ldots\\\hline3\_bca\ldots\\3\_bcb\ldots\end{array}$&$\begin{array}{lll}a&b&d\\\hline 1&1&1\\0&1&1\end{array}$&&$\begin{array}{@{}l@{}}1\un{d}ca\ldots\\1\un{e}ca\ldots\\4\un{b}cb\ldots\\4\un{b}cc\ldots\end{array}$&
$\begin{array}{@{}l@{}}3\un{a}cb\ldots\\3\un{a}cc\ldots\end{array}$&&&$abd$\\\hline
$\begin{array}{l}2\un{d}e\beta\ldots\\\hline3\_bca\ldots\\3\_bcb\ldots\end{array}$&$\begin{array}{lll}a&b&d\\\hline 1&1&1\\0&1&1\end{array}$&&&&&&\\\hline
$\begin{array}{l}3\un{a}b\beta\ldots\\\hline3\_bcc\ldots\end{array}$&$\begin{array}{ll}b&e\\\hline1&1\end{array}$&&&&&&\\\hline
$\begin{array}{l}3\un{a}c\beta\ldots\\\hline2\_abc\ldots\\3\_bcc\ldots\\5\_ccc\ldots\\5\_cec\ldots\end{array}$&$\begin{array}{lllll}a&b&c&d&e\\\hline 1&1&1&0&1\\0&0&0&0&1\\0&0&0&1&0\\0&0&0&1&0\end{array}$&&&&&&$ade$\\\hline
$\begin{array}{l}3\un{a}e\beta\ldots\\\hline2\_aae\ldots\end{array}$&$\begin{array}{ll}a&b\\\hline 1&1\end{array}$&
&$\begin{array}{@{}l@{}}4\un{b}eb\ldots\end{array}$&$\begin{array}{@{}l@{}}3\un{a}eb\ldots\end{array}$&&&\\\hline
$\begin{array}{l}3\un{e}a\beta\ldots\\\hline3\_ecc\ldots\\3\_ece\ldots\\4\_cab\ldots\\4\_cae\ldots\\4\_cbc\ldots\end{array}$&$\begin{array}{llll}b&c&d&e\\\hline 0&0&1&0\\0&0&1&0\\0&1&0&1\\1&0&0&0\\1&1&0&0\end{array}$&&&&&&\\\hline
$\begin{array}{l}4\un{b}c\beta\ldots\\\hline2\_abc\ldots\\3\_ecc\ldots\\3\_ece\ldots\\4\_cab\ldots\\4\_cae\ldots\\4\_cbc\ldots\end{array}$&
$\begin{array}{lllll}a&b&c&d&e\\\hline 0&0&0&0&0\\0&0&0&1&0\\0&0&0&1&0\\1&0&0&0&0\\0&0&0&0&1\\1&1&1&0&1\end{array}$&
$\begin{array}{@{}l@{}}2\un{d}db\ldots\\2\un{d}eb\ldots\\5\un{c}eb\ldots\\5\un{e}eb\ldots\end{array}$&
$\begin{array}{@{}l@{}}3\un{e}eb\ldots\end{array}$&
$\begin{array}{@{}l@{}}2\un{a}db\ldots\\2\un{a}eb\ldots\\4\un{c}eb\ldots\end{array}$&
$\begin{array}{@{}l@{}}2\un{c}db\ldots\\2\un{c}eb\ldots\end{array}$&&$abcde$\\\hline
$\begin{array}{l}4\un{c}a\beta\ldots\end{array}$&&&&&&&$c$\\\hline
$\begin{array}{l}4\un{e}c\beta\ldots\end{array}$&&&&&&&$ac$\\\hline
$\begin{array}{l}1\ldots \beta d\un{b}\\\hline1\ldots aba\_\\1\ldots cbd\_\\2\ldots bcb\_\\2\ldots bdb\_\\2\ldots cdb\_\end{array}$&
$\begin{array}{lll}a&b&d\\\hline0&0&1\\0&1&0\\1&1&0\\1&1&1\\0&1&1\end{array}$&&&&&&$b$\\\hline
$\begin{array}{l}1\ldots\beta c\un{c}\\\hline 1\ldots abc\_\\2\ldots bdb\_\\3\ldots abc\_\\3\ldots dbc\_\end{array}$&
$\begin{array}{ll}b&e\\\hline1&1\\1&1\\1&1\\1&0\end{array}$&&&&&&$b$\\\hline
$\begin{array}{l}1\ldots \beta d\un{c}\\\hline1\ldots abc\_\\2\ldots bab\_\\2\ldots bdb\_\\3\ldots abc\_\\4\ldots aac\_\\4\ldots ccc\_\end{array}$&$\begin{array}{lll}a&b&d\\\hline0&0&1\\1&1&1\\1&1&0\\0&1&0\\0&1&0\\0&0&1\end{array}$&&&&&&$b$\\\hline
$\begin{array}{l}2\ldots \beta b\un{e}\\\hline1\ldots abd\_\\1\ldots dbd\_\\2\ldots bab\_\\2\ldots cab\_\end{array}$&
$\begin{array}{ll}a&d\\\hline1&1\\0&1\\1&0\\0&1\end{array}$&&&&&&$ad$\\\hline
$\begin{array}{l}3\ldots\beta a\un{b}\\\hline1\ldots abd\_\\1\ldots dbd\_\\2\ldots bab\_\\3\ldots cbc\_\end{array}$&
$\begin{array}{lll}b&c&d\\\hline1&0&1\\0&1&1\\1&1&1\\0&1&1\end{array}$&&&&&&\\\hline
$\begin{array}{l}3\ldots \beta b\un{c}\\\hline1\ldots abc\_\\1\ldots dbc\_\\2\ldots bab\_\\4\ldots bcc\_\\4\ldots ccc\_\end{array}$&$\begin{array}{ll}a&d\\\hline1&1\\0&1\\1&1\\1&0\\0&1\end{array}$&$\begin{array}{@{}l@{}}3\ldots ee\un{c}\end{array}$&&&$\begin{array}{@{}l@{}}1\ldots ee\un{a}\end{array}$&$\begin{array}{@{}l@{}}5\ldots ee\un{a}\end{array}$&$a$
\\\hline
$\begin{array}{l}3\ldots \beta a\un{d}\\\hline1\ldots abc\_\\1\ldots dbd\_\end{array}$&
$\begin{array}{ll}b&e\\\hline1&1\\1&1\end{array}$&&&&&&\\\hline
$\begin{array}{l}3\ldots\beta b\un{d}\\\hline1\ldots abc\_\\1\ldots cbd\_\\1\ldots dbd\_\\3\ldots caa\_\end{array}$&
$\begin{array}{lll}b&c&d\\\hline1&0&1\\0&1&1\\1&0&1\\0&1&1\end{array}$&&&&&&$bc$\\\hline
$\begin{array}{l}4\ldots \beta b\un{a}\\\hline2\ldots bab\_\\2\ldots cab\_\\3\ldots abc\_\\3\ldots dbc\_\end{array}$&
$\begin{array}{ll}a&d\\\hline1&0\\0&1\\1&1\\0&1\end{array}$&&&$\begin{array}{@{}l@{}}3\ldots bd\un{d}\\4\ldots bd\un{d}\end{array}$&&&\\\hline
$\begin{array}{l}4\ldots\beta c\un{a}\\\hline2\ldots bdb\_\\3\ldots abc\_\\4\ldots acb\_\\4\ldots ccb\_\end{array}$&
$\begin{array}{ll}b&e\\\hline1&1\\1&1\\1&0\\1&1\end{array}$&&&&&&$b$\\\hline
$\begin{array}{l}4\ldots \beta b\un{d}\\\hline1\ldots abc\_\\1\ldots cbd\_\\1\ldots dbd\_\\3\ldots caa\_\end{array}$&
$\begin{array}{lll}b&c&d\\\hline1&0&1\\0&1&1\\1&0&1\\0&1&1\end{array}$&&&&&&$bc$\\\hline
$\begin{array}{l}5\ldots \beta a\un{d}\\\hline1\ldots abc\_\\1\ldots dbc\_\\3\ldots abc\_\\4\ldots bcc\_\end{array}$&
$\begin{array}{lll}b&c&d\\\hline1&0&1\\0&1&1\\0&1&1\\1&1&1\end{array}$&&&&&&$bc$\\\hline
\end{longtable}


\newpage
\begin{longtable}{c|ccccc}
\caption{RHS's of IRR($n+1$) derived from RHS's of IRR($n$) and $\alpha$\label{RHS_update_3}}\\
RHS of IRR($n$)&\multicolumn{5}{c}{RHS of IRR($n+1$) for symbol $\alpha$}\\
&$a$&$b$&$c$&$d$&$e$\\\hline
$2\_aae\ldots$&&$4\_caa\ldots$&$2abc\ldots$\\
$2\_abc\ldots$&$2dba\ldots$&$4\_cab\ldots$&$2aba\ldots$&$2cba\ldots$&$3\_cab\ldots$\\
$2\_aec\ldots$&$5\_ccc\ldots$&$4\_cae\ldots$&$3\_bcc\ldots$\\
$3\_bca\ldots$&&$4\_cbc\ldots$&$2\_abc\ldots$\\
$3\_bcb\ldots$&&$4\_cbc\ldots$&$2\_abc\ldots$\\
$3\_ecc\ldots$&$2cad\ldots$&$4\_cec\ldots$&$2\_aec\ldots$&$5\_cec\ldots$\\
$3\_ece\ldots$&$3caa\ldots$&$4\_cec\ldots$&$2\_aec\ldots$&$5\_cec\ldots$&$5bcc\ldots$\\
$4\_cab\ldots$&$3\_bca\ldots$&$4bcc\ldots$&$2abd\ldots$&$5\_cca\ldots$\\
$4\_cae\ldots$&$3\_bca\ldots$&$5bcc\ldots$&$2abc\ldots$&$5\_cca\ldots$\\
$4\_cbc\ldots$&$3\_bcb\ldots$&$1bab\ldots$&$2aba\ldots$&$5\_ccb\ldots$\\
$5\_cca\ldots$&$2\_ecc\ldots$&$3\_ecc\ldots$&$2dba\ldots$\\
$5\_ccb\ldots$&$2\_ecc\ldots$&$3\_ecc\ldots$&$5\_cec\ldots$\\
$5\_ccc\ldots$&$2\_ecc\ldots$&$3\_ecc\ldots$&$5\_cec\ldots$&$4\_acc\ldots$&$5\_cec\ldots$\\
$5\_cec\ldots$&$2\_ece\ldots$&$3\_ece\ldots$&$5\_ccc\ldots$\\
$1\ldots abc\_$&$2\ldots bdb\_$&&&$2\ldots bcb\_$&$2\ldots bcb\_$\\
$1\ldots dbc\_$&$2\ldots bdb\_$&&&$2\ldots bcb\_$&$2\ldots bcb\_$\\
$2\ldots bab\_$&$1\ldots abc\_$&&$1\ldots abd\_$&$1\ldots aba\_$&$4\ldots bcc$\\
$2\ldots cab\_$&&&$1\ldots abd\_$\\
$3\ldots abc\_$&&&$2\ldots bab\_$\\
$3\ldots dbc\_$&&&$2\ldots bab\_$\\
$4\ldots bcc\_$&$3\ldots abc\_$&&&$2\ldots cdb\_$&$5\ldots cca\_$\\
$4\ldots ccc\_$&$3\ldots abc\_$&&&$2\ldots cdb\_$&$5\ldots cca\_$\\
\end{longtable}
\fontsize{12}{14}\selectfont

\pagebreak
\fontsize{10}{10}\selectfont
\begin{longtable}{c|c}
\caption{Origins of IRR($n+1$) derived from origins of IRR($n$) for $k=3$ exceptions\label{exceptions_3}}\\
Origin of IRR($n$)&Origins of IRR($n+1$)\\
$2\un{a}db\ldots$&$4\alpha dc\un{a}\ldots$\\\hline
$2\un{a}dc\ldots$&$2\alpha dc\un{e}\ldots$\\\hline
$2\un{a}ec\ldots$&$3\alpha aa\un{d}\ldots$,$4\alpha aa\un{d}\ldots$\\
&$3\alpha ed\un{d}\ldots$,$4\alpha ed\un{d}\ldots$\\\hline
$2\un{c}da\ldots$&$1\alpha ac\un{c}\ldots$,$1\alpha cd\un{c}\ldots$\\
&$5\alpha ed\un{d}\ldots$,$1\alpha ed\un{c}\ldots$\\
&$5\alpha cd\un{d}\ldots$\\\hline
$2\un{c}db\ldots$&$4\alpha ac\un{a}\ldots$,$4\alpha ed\un{a}\ldots$,$4\alpha cd\un{a}\ldots$\\\hline
$2\un{c}dc\ldots$&$2\alpha cd\un{b}\ldots$,$3\alpha cd\un{b}\ldots$\\
&$2\alpha ed\un{e}\ldots$,$2\alpha ed\un{b}\ldots$\\
&$3\alpha ed\un{b}\ldots$,$2\alpha ac\un{e}\ldots$\\
&$2\alpha cd\un{e}\ldots$\\\hline
$2\un{c}dd\ldots$&$1\alpha cd\un{b}\ldots$,$1\alpha ed\un{b}\ldots$\\\hline
$2\un{d}da\ldots$&$1\alpha cb\un{c}\ldots$,$3\alpha cb\un{c}\ldots$,$1\alpha cc\un{c}\ldots$\\\hline
$2\un{d}db\ldots$&$4\alpha cc\un{a}\ldots$,$4\alpha cb\un{a}\ldots$\\\hline
$2\un{d}dd\ldots$&$1\alpha cb\un{a}\ldots$\\\hline
$3\un{a}ca\ldots$&$3\alpha ae\un{c}\ldots$\\\hline
$3\un{a}cd\ldots$&$1\alpha ae\un{a}\ldots$\\\hline
$3\un{a}ce\ldots$&$5\alpha ae\un{a}\ldots$\\\hline
$4\un{b}ca\ldots$&$1\alpha bb\un{c}\ldots$\\
&$5\alpha ea\un{d}\ldots$\\\hline
$4\un{b}cb\ldots$&$4\alpha bb\un{a}\ldots$\\\hline
$4\un{b}cc\ldots$&$2\alpha bb\un{e}\ldots$,$2\alpha ea\un{b}\ldots$,$3\alpha ea\un{b}\ldots$\\\hline
$4\un{b}cd\ldots$&$1\alpha bb\un{a}\ldots$,$1\alpha ea\un{b}\ldots$\\\hline
$4\un{b}ce\ldots$&$5\alpha bb\un{a}\ldots$,$5\alpha bb\un{b}\ldots$\\\hline
$4\un{c}ac\ldots$&$3\alpha cd\un{d}\ldots$,$4\alpha cd\un{d}\ldots$\\\hline
$4\un{e}ca\ldots$&$3\alpha eb\un{c}\ldots$,$1\alpha eb\un{c}\ldots$\\\hline
$4\un{e}cc\ldots$&$2\alpha eb\un{e}\ldots$\\\hline
$1\ldots bd\un{b}$&$1\ldots\un{d}cb\alpha$,$1\ldots\un{e}cb\alpha$\\\hline
$1\ldots bc\un{c}$&$1\ldots \un{d}ac\alpha$,$1\ldots\un{e}ac\alpha$\\\hline
$1\ldots bd\un{c}$&$1\ldots\un{d}cc\alpha$,$1\ldots \un{e}cc\alpha$\\\hline
$2\ldots ab\un{e}$&$2\ldots\un{d}de\alpha$,$2\ldots\un{d}ee\alpha$\\\hline
$2\ldots db\un{e}$&$2\ldots \un{c}de\alpha$,$2\ldots\un{c}ee\alpha$\\\hline
$3\ldots ab\un{c}$&$5\ldots \un{c}ec\alpha$,$5\ldots\un{e}ec\alpha$\\\hline
$3\ldots bb\un{d}$&$3\ldots\un{e}ed\alpha$\\\hline
$3\ldots cb\un{d}$&$4\ldots\un{c}ed\alpha$\\\hline
$4\ldots bc\un{a}$&$1\ldots \un{d}dc\alpha$,$1\ldots \un{e}dc\alpha$,$3\ldots\un{e}aa\alpha$\\\hline
$4\ldots bb\un{d}$&$4\ldots\un{b}bd\alpha$\\\hline
$4\ldots cb\un{d}$&$3\ldots\un{a}bd\alpha$\\\hline
$5\ldots ba\un{d}$&$4\ldots\un{b}ed\alpha$\\\hline
$5\ldots ca\un{d}$&$3\ldots\un{a}ed\alpha$\\\hline
\end{longtable}
\fontsize{12}{14}\selectfont

Table~\ref{origins_3} represents in minimal form some of the rules by which IRR can be changed to new IRR of length $n$ greater by 1. These rules are of length $k = 3$ because they can be written with 3 consecutive symbols. Related information such as the new RHS's, which cannnot be fitted into Table~\ref{origins_3} without repetition are given in Table~\ref{RHS_update_3}. The exceptions where the pointer does not go in the expected direction in the derivation of new origins are given in Table~\ref{exceptions_3} and these are also indicated in the rightmost column of Table~\ref{origins_3} where the appropriate values of $\beta$ are given as was done in Table~\ref{origins_2}. The aim of all these results is to represent $F$ (i.e. the set of all rules by which all the IRR can be generated starting from all the IRR of length 1, the single TM steps) in terms particular to the TM being studied, in a finite form. There may be a finite or an infinite number of rules in $F$, but in the latter case it is hoped that it can always be represented finitely. 


\fontsize{10}{10}\selectfont
\begin{longtable}{c|c}
\caption{Origins of IRR($n+1$) derived from origins of IRR($n$) for $k=4$\label{exceptions_4}}\\
Origin of IRR($n$)&Origins of IRR($n+1$)\\
$2\alpha\un{a}dbd\ldots$&$1\alpha dca\un{b}\ldots$\\
\end{longtable}
\fontsize{12}{14}\selectfont


















%\begin{alg}



\section{Reverse rules}
By following the backward searching algorithm starting from a CS on the LHS, a branching tree is in general produced, and this can be summarised by omitting all intermediate results, just giving the final set of CS's (origins) on the RHS of the reverse rule. This gives a reverse rule which is defined to have a CS the LHS and a set of CS's on the RHS.
The set of CS's on the RHS of a reverse rule is the set of all possible origins for the LHS, which are traced back as far as possible but ignoring branches that terminate with the pointer not at either end of the string (condition 3). In general, the CS's on the RHS of a reverse rule will have some with the pointer at the right, and others with the pointer at the left.

An irreducible reverse rule is a reverse rule that has no redundant symbols in it. This is analogous to the usage for (forward) computation rules. The length of a reverse rule is the number of symbols in the LHS and each of its origin CS's in the RHS. 

%\subsection{Types of results produced by the backward searching algorithm}
%The backward searching algorithm for deriving reachability of a CS generates a tree that can be summarised by just showing on the right the end nodes of the search applied to the CS on the left. These end nodes CS's are naturally split into two subsets, those with the pointer at the left respectively right hand end of the string of symbols. There are two important types of results of this sort, (1) when obtaining the reachability of extensions by one symbol of a LHS of a member of IRR($n$) by adding that symbol at the opposite end from the pointer as described earlier (\cite{jhn2017}), and (2) obtaining reusable results that can be used for the above purpose.

Let $CS(n,p)$ be the set of all CS's such that $n$ and $p$ are respectively the length and position of the pointer (from 1 at the left to $n$ at the right) in the CS. Extra symbols can be added at either end to generate other sets of CS's in the obvious manner, so for example $\alpha CS(n,1)$ is the set obtained from $CS(n,1)$ by adding the symbol $\alpha$ on the left to each member of $CS(n,1)$, so the pointer is now immediately to the right of the $\alpha$ i.e. at position 2 in the string for each member.

The truncation of a CS $X$ of length $n$ to length $l$ is defined when $l\le n$ and is formed by truncating the string to length $l$ so that any symbols lost are taken from the end of the string furthest from the pointer. Ambiguity will only arise if the pointer is in the middle of the string. An alternative terminology will be used if needed in case of ambiguity. 

Backward searching to find the origins of a CS $X$ in $CS(n,n)$ (respectively $CS(n,1)$) leads in general to two sets of CS's, one set denoted by $O_1(X)$ are each in $CS(n,1)$ (respectively $CS(n,n)$) ending in condition 1 and the other set denoted by $O_2(X)$ are each in $CS(n,n)$ (respectively $CS(n,1)$) ending in condition 2. The reverse rule (RevR to distinguish it from RR which is a regular rule) derived is written as 
\begin{equation}\label{2}X\leftarrow \left\{\begin{array}{l}  O_1(X)\text{ (condition 1)}\\ O_2(X)\text{ (condition 2)}\end{array}\right..\end{equation}
Reverse rules result from derivations of the reachability of their LHS's. A CS $X$ is defined to be reachable if and only if $O_1(X)\ne\emptyset$. This is involved in deriving the IRR($n$) for a TM. 
The backward searching algorithm and the 3 conditions any branch can end in was described in detail in my earlier paper \cite{jhn2017} section 2.2. The branches in $O_2(X)$ cannot lead to a proof of the reachability of $X$. If $X$ is the LHS of a member of IRR($n$) of type RL or LR, there is a subset $S$ of the LHS's of IRR($n+1$) associated with $X$ that can be obtained from $X$ by firstly adding an arbitrary single symbol (here  called $\alpha$) at the opposite end of the string from the pointer in $X$, and continuing the backward search algorithm applied to $X$ to find the set $S$ of $\alpha X$ that are reachable i.e. such that $O_1(\alpha X)\ne\emptyset$. The pointer is assumed to be at the right in $X$ in this case. Otherwise $\alpha$ would be added on the right and $S$ would be $\{X\alpha\}|O_1 (X\alpha)\ne 0$

The backward search applied to $\alpha X$ must start as in \eqref{2} with $\alpha$ on the left which plays no role unless the pointer reaches position 2. If this does happen (result in $\alpha O_1(X)$) the pointer could finally reach position 1 without first getting to position $n+1$ (result in $O_1(\alpha X)$) or to position $n+1$ without first getting to position 1. In the latter case the result is in $O_2(\alpha X)$ but not in $\alpha O_2(X)$. $\alpha O_2(X)$ is reached without the pointer ever getting to position 2 and not otherwise. This is expressed as follows:

\begin{equation}\label{3}\alpha X\leftarrow\left\{\begin{array}{l} \alpha O_1(X)\leftarrow\left\{\begin{array}{l}O_1(\alpha X)\\O_2(\alpha X)\setminus\alpha O_2(X)\end{array}\right.\\  \alpha O_2(X)\end{array}\right.
\end{equation} 

Note that it is not possible for the same RHS to be obtained in \eqref{2} from two different paths because the forward computation is unique.
In $\alpha O_2(X)$ the pointer is at the right hand end of the string, so the backward search terminates. 
This shows that in \eqref{2}, the extension of the derivation of the reachability of $X$ to that of $\alpha X$, only the $O_1$ branch of the former is needed.

Involved in \eqref{3} is the backward searching algorithm applied to CS's of the form $CS(n,2)$ ($\alpha O_1(X)$ with $n$ replaced by $n-1$). The result of this is 
\begin{equation}\label{a3}\alpha O_1(X)\leftarrow\left\{\begin{array}{l}O_1(\alpha X)\\O_2(\alpha X)\setminus\alpha O_2(X)
\end{array}\right.\end{equation}
This will be called an auxiliary reverse rule (ARR) to make the distinction between these and (final) reverse rules such as \eqref{2}. In general an ARR of length $n$ will be a reverse rule having a LHS in $CS(n,2)$ or $CS(n,n-1)$. All types of reverse rules have an RHS which consists of two sets of CS's, which are the sets of endpoints of the backward search algorithm, so the pointer is at one end of the string (condition 3 branches are deleted). They will be denoted by the functions $O_1$ and $O_2$ applied to the LHS as in \eqref{2} as if the LHS had had the pointer at the adjacent endpoint of the string. This definition only fails if the length $n$ of the ARR is $\leq 3$. The notations $O_L(X)$ and $O_R(X)$ will likewise refer to the sets of origins of $X$ with the pointer at the left and right respectively. These can be used whenever $n\ge 1$ (but it is trivial if $n=1$ because then $O_L(X)=O_R(X)=X$).

Now it is possible to describe in general the application of an ARR
\begin{equation}\label{b3}Z\leftarrow\{O_1(Z),O_2(Z)\}\end{equation} to extending the reachability of $X$ indicated by
\begin{equation}\label{e3}X\leftarrow Y\end{equation} for some CS's $X\in CS(n,n)$ and $Y\in CS(n,1)$. In this case the $\alpha$ must be added on the left giving \begin{equation}\label{c3}\alpha X\leftarrow\alpha Y.\end{equation}
Continuing the backward search algorithm gives
\begin{equation}\label{f3}\alpha X\leftarrow\alpha Y\leftarrow\{O_1(\alpha Y),O_2(\alpha Y)\}
\end{equation} where by definition
$O_1(\alpha Y)=O_2(\alpha X)$ and
$O_2(\alpha Y)=O_1(\alpha X)$. If $\alpha Y$ matches $Z$ i.e. $\alpha Y=ZT$ for some string $T$, and using \eqref{b3} gives
\begin{equation}\label{d3}\alpha X\leftarrow \alpha Y=ZT\leftarrow\{O_1(Z)T=O_1(\alpha Y),O_2(Z)T=O_2(\alpha Y)\}.\end{equation}
Here $\alpha Y$ has the pointer at position 2 so $O_2(\alpha Y)$ has the pointer at position 1
therefore the $O_2(\alpha Y)$ branch demonstrates the reachability of $\alpha X$. That is, the reachability of $\alpha X$ true if and only if $O_2(\alpha Y)\ne\emptyset$ ($\Leftrightarrow O_2(Z)\ne\emptyset$). 
If $O_1(\alpha Y)=\emptyset$ ($\Leftrightarrow O_1(Z)=\emptyset$), the pointer cannot reach the right hand end in \eqref{f3}. If the rightmost position of the pointer is $l\le n$, \eqref{b3} can be truncated from the right to length $l+1$ (if it was truncated to length $l$ and the backward searching algorithm would stop with the pointer at the right) and then $T$ has length $n-l$. Otherwise $T$ is the empty string $\epsilon$ of length 0 and there is no truncation in \eqref{f3}.
The ARR \eqref{b3} will be called irreducible because there are then no redundant symbols in it and \eqref{b3} will be referred to as an AIRR (auxiliary irreducible reverse rule) in analogy with the irreducible regular rules (IRR) introduced earlier \cite{jhn2013} and will be unique. From now on any ARR applied to continue the derivation of the reachability of $X$ to that of $\alpha X$ (or $X\alpha$) will be assumed to be an AIRR. 

The mirror image form when $X\leftarrow Y$ where $X\in CS(n,1)$ and $Y\in CS(n,n)$ is treated similarly with the matching condition being $Y\alpha=TZ$.
\subsection{Classification of reverse rules}

It has been found useful to classify an AIRR \eqref{b3} (could also be applicable to RevR) according to whether $O_1(X)=\emptyset$ and whether $O_2(X)=\emptyset$ where $X$ is its LHS. 

If both $O_1(X)\ne\emptyset$ and $O_2(X)\ne\emptyset$, the AIRR has origins for the LHS with the pointer at either end of the string and will be called a two-way AIRR (written as $\pm$). This is true for most of the AIRR of length 3 and sometimes occurs for the AIRR of length 4 and 5 for TM1. This situation might indicate that the AIRR could be extended by adding an extra symbol on its LHS $X$ (to the right if $X\in CS(2,n)$ and to the left if $X\in CS(n,n-1)$) and following through to generate the RHS such that the new AIRR is not of this type.

Now suppose $O_1(X)\ne\emptyset$ and $O_2(X)=\emptyset$. In this case all the origins $Y$ of $X$ have the pointer at the far end of the string from where it started i.e. $Y\in CS(n,n)$ if $X\in CS(n,2)$ and $Y\in CS(n,1)$ if $X\in CS(n,n-1)$. These are the direction changing one-way AIRR (written as $-$).

Now consider the reverse i.e. $O_1(X)=\emptyset$ and $O_2(X)\ne\emptyset$. In this case the pointer starts at position 2 (respectively $n-1$) and ends at position 1 (respectively $n$) in all branches of the reverse computation. These are non direction changing one-way AIRR (written as $+$). 

Finally if both $O_1(X)=\emptyset$ and $O_2(X)=\emptyset$ the AIRR terminates the search with no results and the AIRR may be called a null AIRR (written as $\emptyset$).

To classify a reverse rule, 3 elements will be used in this order: its length, the pointer position in its LHS, the set of pointer positions in the RHS's. This is done according to the following table:


\begin{equation}\label{revr_summ}\begin{tabular}{lrlcc|c}
Reverse && Condition & Position of& Symbol & Possible \\rule type && & pointer in & for LHS & symbols\\
&&&LHS&& for RHS\\
\hline
\multirow{2}{*}{RevR } &&$n\ge 2$ & 1 & L & $\pm,+,-,\emptyset$\\
& &$n\ge 2$ & n & R & $\pm,+,-,\emptyset$\\
\hline
\multirow{3}{*}{AIRR} & & $n=3$ & 2 & & $\pm,\,L,\;R,\,\emptyset$\\
&& $n>3$ & 2 & L & $\pm,+,-,\emptyset$\\
&& $n>3$ & $n-1$ & R & $\pm,+,-,\emptyset$\\
\end{tabular}\end{equation}


This gives the following possible classifications for AIRR:
$3\pm$, $3L$, $3R$, $3\emptyset$, and $nL\pm$, $nL-$, $nL+$, $nL\emptyset$, $nR\pm$, $nR-$, $nR+$, $nR\emptyset$ where $n\ge4$, and the following for RevR:
$nL\pm$, $nL-$, $nL+$, $nL\emptyset$, $nR\pm$, $nR-$, $nR+$, $nR\emptyset$ where $n\ge3$.



Therefore using this notation, the result above can be written as follows:
\begin{Lemma}\label{thm1}
Given a reachability derivation $X\leftarrow Y$ for $X\in CS(n,n)$ (respectively $X\in CS(n,1)$), for which necessarily $Y\in CS(n,1)$ (respectively $Y\in CS(n,n)$), then an AIRR $A$ of the form \eqref{2} of length $\le n+1$ can be found uniquely such that when the substitution \eqref{d3} is made (respectively using $Y\alpha=ZT$), the reverse rule generated by $\alpha X$ (respectively $X\alpha$) is produced, and $\alpha X$ (respectively $X\alpha$) is reachable if and only if $O_2(\alpha Y)\ne\emptyset$ (respectively $O_2(Y\alpha)\ne\emptyset$). If the length of $C$ is less than $n+1$ (which is true if and only if $O_1(\alpha Y)=\emptyset$ or respectively $O_1(Y\alpha)=\emptyset$) then the type of $A$ is $+$ or $\emptyset$. Note the extension of the definition of reachability to $CS(n,2)$ and $CS(n,n-1)$. This was done so that Lemma~\ref{thm1} can be extended to starting with an AIRR. 
\end{Lemma}

The matching in \eqref{d3} suggests that $Z$ should have its leftmost symbol arbitrary, for application to the case when $X\in CS(n,n)$ and $Y\in CS(n,1)$. Likewise so should be its rightmost symbol to allow the AIRR to be used in the same way if the $\alpha$ was added on the right. Thus a parameterised set of AIRR's with an arbitrary symbol on the left or on the right or both should probably be considered as a single AIRR.

Unless any range of values of any placeholder symbol is specified, it will be assumed to be the complete set of symbols used by the TM under discussion. Many equations in this paper define parameterised sets of reverse rules. Sometimes placeholder symbols can appear in the RHS but not in the LHS of a reverse rule. This happens when the results in the RHS are summarised. Then the range of the placeholder symbol needs to be specified. 

Now suppose instead of the conditions of Lemma~\ref{thm1}, $X\in CS(n,n-1)$ (respectively $X\in CS(n,2)$) so that one branch of an AIRR is under consideration i.e. $X\leftarrow Y$ where $Y\in CS(n,1)$ (respectively $Y\in CS(n,n)$). Then because $X$ plays very little role in the arguments, the result is the same except that the concept of reachability has been extended to CS's $\in CS(n,2)\cup CS(n,n-1)$. The conclusion is that there is a unique AIRR $A$ \eqref{b3} of length $\le n+1$ such that when the substitution \eqref{d3} (or its mirror image form) is made the reverse rule generated by the extension of $X$, $\alpha X$ (respectively $X\alpha$) is produced and this extension of $X$ is reachable if and only if $O_2(\alpha Y)\ne\emptyset$ (respectively $O_2(Y\alpha)\ne\emptyset$). Also  
 the length of the AIRR $A$ is $<n+1$ if and only if $O_1(\alpha Y)=\emptyset$ (respectively $O_1(Y\alpha)=\emptyset$), and this implies that the type of $C$ is $+$ or $\emptyset$.

I shall now take the further obvious step of extending the hypothesis to allow multiple RHS's i.e. assuming an AIRR, say $C$ whose length is $\ge4$. The pointer in the LHS of $C$ is next to the opposite end of the string from where it is in an $O_1$ branch of $C$, and the $\alpha$ is at this end too and the substitution \eqref{b3} can be made, however for the RHS's that are in $O_2$, the $\alpha$ is at the opposite end from where the pointer is when a substitution is to be made, and so the backward search terminates. Thus the above arguments only apply to the $O_1$ branches of $C$. The result is now stated as a theorem because of its obvious importance.

\begin{Theorem}\label{thm11.2}Suppose that $C$ is an AIRR or an RevR of length $n\ge 4$ for the TM under consideration so that $C$ can be expressed by \eqref{b3}. Now add the arbitrary symbol $\alpha$ (on the left or the right) to the LHS and each RHS of $C$ giving say $B$. Whether the added symbol is on the left or right is determined such that the LHS of $B\in CS(n+1,2)\cup CS(n+1,n)\cup CS(n+1,1)\cup CS(n+1,n+1)$. Then $B$ follows from $C$, and the backward searching algorithm can be applied to each RHS of $B$ that arose from an $O_1$ branch of $C$. For each case this leads to a unique AIRR again of the form $C$ \eqref{b3} of length $\le n+1$ such that when the substitutions \eqref{d3} (or its mirror image form) are made for each $O_1$ branch of $C$, the reverse rule $D$ generated by the LHS of $B$ is produced and the LHS of $B$ (= LHS of $D$) is reachable if and only if there exists an RHS $E$ of $B$ such that $O_2(E)\ne\emptyset$. For each such AIRR $A$, the length of $C<n+1$ if and only if $O_1(E)=\emptyset$, and this implies that the type of $C$ is $\neg M$.
\end{Theorem}

Similarly to \eqref{3}, if the LHS of $C$ is $Z\in CS(n,2)$ then the final reverse rule say $D$ can be represented as follows showing the intermediate steps:
\begin{equation}Z\alpha\leftarrow\left\{\begin{array}{l}O_1(Z)\alpha\leftarrow \left\{\begin{array}{l}O_1(Z\alpha)\\ O_2(Z\alpha)\setminus O_2(Z)\alpha\end{array}\right.\\ O_2(Z)\alpha\end{array}\right.
\end{equation}

Thus associated with the AIRR $C$ and the symbol $\alpha$ at the start, there is a set of AIRR's generically called $C$, and the result of the substitutions is the AIRR $D$. Notations might be useful for these, so I define the functions $f$ and $inc$ (abbreviation of increment) such that $f(C,\alpha)$ is the set of AIRR's $A$, and $inc(C,\alpha)=D$.

It will be also useful to have the combined types $P$ for plus i.e. $+$ or $\pm$ which means there is a backward search with the pointer staying at the same end of the string, likewise $M$ for minus will mean $-$ or $\pm$ i.e. there is a backward search with the pointer going to the opposite end of the string. Then we can write

\begin{equation}\begin{array}{rl}&\hspace{-0.5 em}P\Leftrightarrow \pm\vee +\\&\hspace{-0.5 em}M\Leftrightarrow\pm\vee -\\ \neg &\hspace{-0.5 em}P\Leftrightarrow -\vee\emptyset\\ \neg &\hspace{-0.5 em}M\Leftrightarrow +\vee\emptyset\end{array}\end{equation} and
\begin{equation}\label{pm_def}\begin{array}{llll}\emptyset&\hspace{-1 em}\Leftrightarrow\neg &\hspace{-0.5 em}P\;\wedge\neg &\hspace{-0.5 em}M\\+&\hspace{-1 em}\Leftrightarrow &\hspace{-0.5 em}P\;\wedge\neg &\hspace{-0.5 em}M\\-&\hspace{-1 em}\Leftrightarrow\neg &\hspace{-0.5 em}P\;\;\wedge &\hspace{-0.5 em}M\\\pm &\hspace{-1 em}\Leftrightarrow &\hspace{-0.5 em}P\;\;\wedge &\hspace{-0.5 em}M\end{array}\end{equation}
where as usual $\neg$ means {\em not}, $\wedge$ means {\em and}, $\vee$ means {\em inclusive or}, and $\Leftrightarrow$ means {\em logical equivalence}, and the $\neg$ operators are applied before any others by default.

In general the type of the AIRR $D$ obtained as in Theorem~\ref{thm11.2} by extending the AIRR $C$ by a single extra symbol is of interest. The following arguments show how this can be done.

Define ``$D$ has type $P\text{ via }O_1$" to mean that $D$ has type $P$ (a reverse path exists ending with the pointer at the same end of the string as where it starts) and there exists one of the these reverse paths starting (going backwards) from an $O_1$ path of $C$. Likewise $P\text{ via }O_2$ is defined. Because a backward $P$ path must start with either $O_1$ or $O_2$ (paths via $O_1$ have the pointer reach next to the $\alpha$ and paths via $O_2$ do not) it follows that for any $D$, $P\Leftrightarrow (P\text{ via }O_1)\vee (P\text{ via }O_2)$. 

These cases can be illustrated (including case $M$) as follows:
\begin{equation}\begin{array}{lll}
\left.\begin{array}{l}\quad\quad\!\alpha xx\un{x}x\\\quad\quad\quad\uparrow\\C\left\{\begin{array}{c}\alpha \un{x}xxx\\\uparrow\\\alpha xxx\un{x}\end{array}\right.\end{array}\right\} P\text{ via }O_1 &
\left.\begin{array}{c}\quad\,\alpha xx\un{x}x\\\quad\,\,\uparrow\\C\left\{\begin{array}{c}\alpha\un{x}xxx\\\uparrow\\\un{x}xxxx\end{array}\right.\end{array}\right\}M\text{ via }O_1 &
\left.\begin{array}{c}\alpha xx\un{x}x\\\uparrow\\\alpha xxx\un{x}\end{array}\right\}P\text{ via }O_2
\end{array}\end{equation}
Of course the mirror image forms also apply.

For the case via $O_2$, only type $P$ and not $M$ is possible because $O_2$ takes the pointer back to the same end of the string, opposite to the $\alpha$ where the backward search terminates. 
Thus $M\Leftrightarrow (M\text{ via }O_1)\vee (M\text{ via }O_2)\Leftrightarrow M\text{ via }O_1$.

Now consider the type of the substitution AIRR $C$ associated with each case.
In the case that $D\text{ has type }P\text{ via }O_1$ the reverse path must end next to the same end of the string as where it started, so the final part after the substitution must take the pointer back again, so $C$ must have type $M$.
\begin{equation}D\text{ has type }P\text{ via }O_1\Leftrightarrow \exists\text{ an }O_1\text{ branch of }C\text{ such that }C\text{ has type }M\end{equation} and because branches starting with $O_2$ terminate without a substitution, \begin{equation}D\text{ has type }P\text{ via }O_2\Leftrightarrow\exists\text{ an }O_2\text{ branch of }C.\end{equation} As above, $D\text{ has type }M\text{ via }O_2$ is impossible, and \begin{equation}D\text{ has type }M\text{ via }O_1\Leftrightarrow\exists\text{ an }O_1\text{ branch of }C\text{ such that }A\text{ has type }P.\end{equation} These statements combine to give the following

\begin{equation}\label{p}\left.\begin{array}{l}D\text{ has type }P\Leftrightarrow\begin{array}{l}(\exists\text{ an }O_1\text{ branch of }C\text{ such that }A\text{ has type }M)\vee\\(\exists\text{ an }O_2\text{ branch of }C)\end{array}\\[15pt]
D\text{ has type }M\Leftrightarrow\exists\text{ an }O_1\text{ branch of }C\text{ such that }A\text{ has type }P\end{array}\right\}\end{equation}
The results \eqref{p} can be combined with \eqref{pm_def} showing how the type of $D$ can be determined as one of $\pm,+,-,\emptyset$.
\begin{thebibliography}{99}
\bibitem{jhn2013}\href{http://www.e-hilaris.com/MA/2013/MA3_9_1.pdf}{Methods for Understanding Turing Machine Computations}

\bibitem{jhn2017}
\href{http://e-hilaris.com/MA/2017/MA7_1_2.pdf}{John Nixon Reverse engineering Turing Machines and the Collatz Conjecture}
\bibitem{tie}
\href{http://www.bluesky-home.co.uk/tie_v2_1.txt}{The previous version in D of the computer program for analysis of Turing Machines}
\bibitem{Tarjan's_paper}\href{https://doi.org/10.1137/0201010}{SIAM Journal on Computing, 1 (2): 146–160, Depth-First Search and Linear Graph Algorithms doi:10.1137/0201010}
\bibitem{Tarjan's_algorithm}
\href{http://bluesky-home.co.uk/Tarjan_v1_0.txt}{An implementation of Tarjan's strongly connected components algorithm in D}
\bibitem{tie_v3_0_draft}\href{http://www.bluesky-home.co.uk/tie_v3_0_draft.txt}{draft of new program doing the computations in this paper}
\end{thebibliography} 

In this section the consequences of the backward search algorithm moving the pointer in the unexpected direction i.e. away from the symbol $\alpha$ will be considered. This happened in many of the derivations in Tables \ref{irr_2r} and \ref{irr_2r.2} and is summarised in the rightmost column of Table~\ref{origins_2}. Here the values of $\beta$ giving rise to such a case are listed.
%The strategy being followed here is the obvious one although the results are complicated.
To understand this consider the following reverse rule obtained when attempting another derivation in a way similar to \eqref{addalpha3}.
\begin{equation}4\ldots c\un{a}\alpha\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}5ca\un{d}\\
\stackrel{\alpha=c}{\leftarrow}\left\{\begin{array}{l}2ca\un{b}\\3ca\un{b}\end{array}\right.\\
\stackrel{\alpha=d}{\leftarrow}1ca\un{b}\\
\leftarrow 3\un{a}a\alpha\end{array}\right..
\end{equation}
Following up just the single bottom branch with the pointer ending up opposite to the $\alpha$ and putting back the symbol(s) truncated in the above argument (from \eqref{irr3.41}) i.e. 
$\alpha_2\in\{a,c,d\}$ and following the backward search algorithm from here to obtain all origins gives 
\begin{equation}4\alpha_2 c\un{a}\alpha\dashleftarrow 3\alpha_2\un{a}a\alpha\left\{\begin{array}{l}\stackrel{\alpha_2=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}aa\alpha\\5\un{e}aa\alpha\end{array}\right.\\
\stackrel{\alpha_2=b}{\leftarrow} 3\un{e}aa\alpha\\
\stackrel{\alpha_2=c}{\leftarrow} 4\un{c}aa\alpha\\
\leftarrow 1\alpha_2 a\un{c}\alpha\leftarrow 2\alpha_2\un{d}c\alpha\stackrel{\alpha_2=b}{\leftarrow}\left\{\begin{array}{l}1\un{d}dc\alpha\\1\un{e}dc\alpha\end{array}\right.\\
\end{array}\right..
\end{equation}
This when restricted to $\alpha_2\in\{a,c,d\}$ and summarised gives \eqref{l4start}. All results derived from \eqref{ind1} similarly are listed now where I introduce the notation 
$\dashleftarrow$ to be like an incomplete $\leftarrow$ meaning that some of the results on the right may be omitted. Exactly how the selection has been made will be made clear whenever it is used.

\begin{equation}\label{l4start}4\alpha_2 c\un{a}\alpha\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha_2=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}aa\alpha\\5\un{e}aa\alpha\end{array}\right.\\
\stackrel{\alpha_2=c}{\leftarrow}4\un{c}aa\alpha\end{array}\right.\text{ for }\alpha_2\in\{a,c,d\}
\end{equation}

\begin{equation}3\alpha_2 a\un{d}\alpha\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha_2=a}{\leftarrow}4\un{e}cd\alpha\\
\stackrel{\alpha_2=a}{\leftarrow}4\un{e}ed\alpha\end{array}\right.
\text{ for }\alpha_2\in\{a,c,d\}\end{equation}

\begin{equation}\label{example}2\alpha\un{\beta}\gamma e\dashleftarrow\left\{
\begin{array}{l}\stackrel{\gamma=d}{\leftarrow}\left\{
  \begin{array}{l}
\stackrel{\beta=a}{\leftarrow}\left\{
    \begin{array}{l}\stackrel{\alpha=b}{\leftarrow}\left\{
      \begin{array}{ll}1\un{d}dae&1\un{e}dae\end{array}\right\}\\
5\alpha dc\un{b}\end{array}\right.\\
\stackrel{\beta=c}{\leftarrow}\left\{
      \begin{array}{l}\stackrel{\alpha=b}{\leftarrow}\left\{
        \begin{array}{lll}
1\un{d}aae&4\un{b}cde&1\un{d}abe\\1\un{e}aae&3\un{e}ade&1\un{e}abe\\\end{array}\right\}\\
        \leftarrow\left\{\begin{array}{lll}5\alpha ac\un{b}&5\alpha cd\un{b}&5\alpha ed\un{b}\end{array}\right\}\\
\stackrel{\alpha=a}{\leftarrow}\left\{
        \begin{array}{lll}4\un{e}cce&5\un{c}ade&4\un{e}ece\\5\un{e}ade&&\end{array}\right.\\
\stackrel{\alpha=c}{\leftarrow}\left\{\begin{array}{ll}3\un{a}cde&4\un{c}ade\end{array}\right\}\end{array}\right.\\
\stackrel{\beta=d}{\leftarrow}\left\{\begin{array}{l}


\stackrel{\alpha=b}{\leftarrow}\left\{
      \begin{array}{llll}1\un{d}cae&4\un{b}cce&1\un{e}cae&4\un{b}cbe\end{array}\right\}\\
\leftarrow\left\{
      \begin{array}{lll}5\alpha cc\un{b}&5\alpha cb\un{a}&5\alpha cb\un{b}\end{array}\right\}\\
\stackrel{\alpha=c}{\leftarrow}\left\{
      \begin{array}{ll}3\un{a}cce&3\un{a}cbe\end{array}\right\}\\\end{array}\right.\end{array}\right.\\
\stackrel{\gamma=e,\beta=a}{\leftarrow}\left\{
    \begin{array}{ll}\stackrel{\alpha=b}{\leftarrow}4\un{b}eae\\\stackrel{\alpha=c}{\leftarrow}3\un{a}eae\end{array}\right.\end{array}\right.
\end{equation}

\begin{equation}5aa\un{d}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}5ea\un{d}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}2\alpha\un{c}ee\dashleftarrow\emptyset\end{equation}
\begin{equation}3aa\un{b}\alpha\dashleftarrow\left\{\begin{array}{l}4\un{e}cb\alpha\\4\un{e}eb\alpha\end{array}\right.
\end{equation}
\begin{equation}3ea\un{b}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}1aa\un{b}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}1ea\un{b}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}3ab\un{d}\alpha\dashleftarrow\left\{\begin{array}{l}5\un{c}ed\alpha\\5\un{e}ed\alpha\end{array}\right.\end{equation}
\begin{equation}3eb\un{d}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}3\alpha\un{e}ec\dashleftarrow\left\{\begin{array}{l}3\alpha eb\un{d}\\4\alpha eb\un{d}\end{array}\right.
\end{equation}
\begin{equation}3\alpha\un{e}ed\dashleftarrow\emptyset\end{equation}
\begin{equation}3bb\un{c}\alpha\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}3bee\un{c}\\
\stackrel{\alpha=d}{\leftarrow}1bee\un{a}\\
\stackrel{\alpha=e}{\leftarrow}5bee\un{a}\\
\leftarrow 3\un{e}ec\alpha\end{array}\right.\end{equation}
\begin{equation}3cb\un{c}\alpha\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}3cee\un{c}\\
\stackrel{\alpha=d}{\leftarrow}1cee\un{a}\\
\stackrel{\alpha=e}{\leftarrow}5cee\un{a}\\
\leftarrow 4\un{c}ec\alpha\end{array}\right.\end{equation}
\begin{equation}3eb\un{c}\alpha\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha=a}{\leftarrow}3eee\un{c}\\
\stackrel{\alpha=d}{\leftarrow}1eee\un{a}\\
\stackrel{\alpha=e}{\leftarrow}5eee\un{a}\\
\end{array}\right.\end{equation}
\begin{equation}4\alpha_2 b\un{a}\alpha\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha_2=b}{\leftarrow}4\un{b}ba\alpha\\
\stackrel{\alpha_2=c}{\leftarrow}3\un{a}ba\alpha\\
\stackrel{\alpha=c}{\leftarrow}\left\{\begin{array}{ll}3\alpha_2 bd\un{d}&4\alpha_2 bd\un{d}\end{array}\right\}\end{array}\right.
\text{ for }\alpha_2\in\{b,c,e\}
\end{equation}

\begin{equation}2\alpha_2b\un{e}\alpha
\stackrel{\alpha_2=c}{\dashleftarrow}\left\{\begin{array}{l}2\un{a}de\alpha\\2\un{a}ee\alpha\\
\end{array}\right.\text{ for }\alpha_2\in\{b,c,e\}\end{equation}
\begin{equation}4eb\un{d}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}4ab\un{d}\alpha\dashleftarrow\emptyset\end{equation}
\begin{equation}2\alpha\un{d}ee\dashleftarrow\emptyset\end{equation}
\begin{equation}3\alpha\un{e}aa\dashleftarrow\emptyset\end{equation}
\begin{equation}3\alpha\un{a}b\alpha_2\dashleftarrow\left\{\begin{array}{l}\stackrel{\alpha_2=a}{\leftarrow}5\alpha aa\un{d}\\\stackrel{\alpha_2=d}{\leftarrow}1\alpha aa\un{b}\end{array}\right.\end{equation}
\begin{equation}4\alpha\un{c}aa\dashleftarrow\emptyset\end{equation}
\begin{equation}1\alpha_2 d\un{c}\alpha\dashleftarrow\emptyset\text{ for }\alpha_2\in\{c,e\}\end{equation}
\begin{equation}1\alpha_2 d\un{b}\alpha\dashleftarrow\emptyset\text{ for }\alpha_2\in\{c,e\}\end{equation}
\begin{equation}3\alpha\un{a}ed\dashleftarrow\left\{\begin{array}{l}
\stackrel{\alpha=b}{\leftarrow}4\un{b}ebd\\
\stackrel{\alpha=c}{\leftarrow}3\un{a}ebd\\\end{array}\right.
\end{equation}
\begin{equation}\label{end}4\alpha\un{e}cd\dashleftarrow1\alpha eb\un{a}\end{equation}
\begin{equation}4\alpha\un{e}cb\dashleftarrow4\alpha eb\un{a}\end{equation}

Only the results in the set \eqref{l4start}-\eqref{end} where the pointer in the origin (i.e. the RHS) is at the same end as the $\alpha$ will give rise to any members of IRR(4) because the others do not establish the reachability of the LHS.  The result \eqref{l4start} does not satisfy this condition. An example that does satisfy it is from \eqref{example}
\begin{equation}\label{l4ex2}2\alpha\un{d}de\stackrel{\alpha=b}{\dashleftarrow}\left\{\begin{array}{l}1\un{d}cae\\1\un{e}cae\\4\un{b}cce\\4\un{b}cbe\end{array}\right.
\end{equation}
The context in which this arose i.e. the member of IRR(3) concerned \eqref{irr3.45_1}.1 has type RL so it is potentially extendable to members of IRR(4) and these results can be combined to give the following result in IRR(4) where the LHS is $2bab\un{e}$
\begin{equation}\left.\begin{array}{l}1\un{d}cae\\1\un{e}cae\\4\un{b}cce\\4\un{b}cbe\end{array}\right\}\to2b\un{d}de\to2bab\un{e}\to3\un{b}bcc\to4\_cbcc\end{equation}
which gives the IRR
\begin{equation}\left.\begin{array}{l}1\un{d}cae\\1\un{e}cae\\4\un{b}cce\\4\un{b}cbe\end{array}\right\}\to2bab\un{e}\to4\_cbcc\end{equation}

Doing this for the remaining results in the list \eqref{l4start}-\eqref{end} gives the following results for IRR(4) in triplet form
\begin{equation}\left.\begin{array}{l}1\un{d}cae\\1\un{e}cae\\4\un{b}cce\\4\un{b}cbe\end{array}\right\}\to2bab\un{e}\to4\_cbcc\end{equation}

\begin{equation}\left.\begin{array}{lll}1\un{d}aae&4\un{b}cde&1\un{d}abe\\1\un{e}aae&3\un{e}ade&1\un{e}abe\\\end{array}\right\}
\to2bdb\un{e}\to3\_eccc\end{equation}
\begin{equation}\left.\begin{array}{l}4\un{e}cce\\5\un{c}ade\\4\un{e}ece\\5\un{e}ade\end{array}\right\}\to 2adb\un{e}\to2\_eccc\end{equation}
\begin{equation}\left.\begin{array}{l}3\un{a}cde\\4\un{c}ade\end{array}\right\}\to 2cdb\un{e}\to5\_ceca\end{equation}
\begin{equation}\left.\begin{array}{l}3\un{a}cce\\3\un{a}cbe\end{array}\right\}\to 2cab\un{e}\to2\_abcc\end{equation}
\begin{equation}3bee\un{c}\to4\un{b}caa\to3babc\_\end{equation}
\begin{equation}1bee\un{a}\to4\un{b}cad\to2bcdb\_\end{equation}
\begin{equation}5bee\un{a}\to4\un{b}cae\to5bcca\_\end{equation}
\begin{equation}3eee\un{c}\to4\un{e}caa\to3adbc\_\end{equation}
\begin{equation}1cee\un{a}\to4\un{c}cad\to2abcb\_\end{equation}
\begin{equation}5cee\un{a}\to4\un{c}cae\to2abcb\_\end{equation}
\begin{equation}3cee\un{c}\to4\un{c}caa\to2abdb\_\end{equation}
\begin{equation}1eee\un{a}\to4\un{e}cad\to2aadb\_\end{equation}
\begin{equation}5eee\un{a}\to4\un{e}cae\to5aaca\_\end{equation}
\begin{equation}\left.\begin{array}{l}3bbd\un{d}\\4bbd\un{d}\end{array}\right\}\to4\un{b}cbc\to1babd\_\end{equation}
\begin{equation}\left.\begin{array}{l}3cbd\un{d}\\4cbd\un{d}\end{array}\right\}\to4\un{c}cbc\to2abab\_\end{equation}
\begin{equation}\left.\begin{array}{l}3ebd\un{d}\\4ebd\un{d}\end{array}\right\}\to4\un{e}cbc\to2cbab\_\end{equation}
\begin{equation}4\un{b}ebd\to5bca\un{d}\to4\_caba\end{equation}
\begin{equation}3\un{a}ebd\to5cca\un{d}\to4abcc\_\end{equation}

This argument shows that there are other ways to generate IRR's from existing ones that are not contained in the Tables \ref{irr_2r} and \ref{irr_2r.2} by making use of the cases explicitly excluded by the Search Condition.

******************

 A more general approach to this is to search for a given outline
in the column headed IRR($n+1$) to find the IRR($n$) and $\alpha$ from which it is derived, then go forwards again with the derivation but this time do not truncate the extra symbol. This results in an IRR truncated triplet of length $k=3$. Then this can be used as a starting point for a derivation analogous to those summarised in Table~\ref{origins_2} but giving results having length $k=3$.
This will now be carried out using Theorem~\ref{groups} and Table~\ref{RHSs}.

The starting points for these derivations are the entries in Tables~\ref{irr_2r} and \ref{irr_2r.2}, from the abbreviated IRR triplet (A) of length $k$ of an IRR of length $n$, under the heading IRR($n$) to where the derivation of the new origins go unexpectedly to the opposite end of the string from the arbitrary symbol $\alpha$. This results in an abbreviated non-IRR triplet (B) of length $k+1$ in the last column that does not represent IRR's because the pointer is at the wrong end in the origin, so not demonstrating the reachability of the LHS. These cases could represent incomplete derivations of new abbreviated IRR triplets where the pointer could move back to where the $\alpha$ is if there were more symbols included. An extra symbol in A is found by searching in Tables \ref{irr_2r} or \ref{irr_2r.2} (the one which contains $A$) for all possible entries $C$ under IRR($n$) that lead to $A$ in the last column, and for each such $C$, rederive $A$ (now called $A'$) without deleting the extra symbol thus $A'$ has length $k+1$. Then for each $A'$, add the arbitrary symbol $\alpha$ as in the general procedure in section~\ref{sec2} and carry out the backward search to find all the new origins for each value of $\alpha$. Also the new RHS's must be found from the RHS of $A'$ for each $\alpha$. Then for each $\alpha$ all the derived IRR triplets having length $k+1$ symbols specified are listed. If there are any cases where the backward search algorithm leads to the opposite end of the string from the $\alpha$, these are included in full (length $k+2$)

Are the results for $n=4$ included, i.e those derived by keeping an extra symbol at one point?

For example, the abbreviated IRR $A=2\un{a}d\ldots\to\to 2\_ae\ldots$ leads to 
the abbreviated non-IRR $B=5\alpha a\un{a}\ldots\to\to RHS$ where the RHS is dependent on $\alpha$ and is not specified (can be worked out easily).

 Table \ref{irr_2r} shows that $C=1\un{e}c\ldots\to \{1,2\}bd\ldots\to 3\_ec\ldots$ leads to $A$. Then rederive $A$ from $C$, which starts by finding all origins of $1\alpha \un{e}c\ldots$ i.e. $2\un{d}ec\ldots$, $2\un{a}ec\ldots$, and $2\un{c}ec\ldots$ for $\alpha = a, c, d$ respectively. The result matches the origin of $A$ only if $\alpha = c$ therefore $A' = 2\un{a}ec\to\{1,2\}cbd\ldots\to 2\_aec\ldots$. Then apply $F$ again, this time ignoring the result leading to line 12 of Table~\ref{irr_2r} because it has already been found, starting with the origins of $2\alpha\un{a}ec\ldots$ given by
\begin{equation}2\alpha\un{a}ec\ldots\leftarrow 5\alpha a\un{a}c\ldots \leftarrow \left\{\begin{array}{l}3\alpha aa\un{d}\ldots\\4\alpha aa\un{d}\ldots\\4\alpha\un{e}ac\ldots\left\{\begin{array}{l}\leftarrow 5\alpha e\un{d}c\ldots\leftarrow \left\{\begin{array}{l}3\alpha ed\un{d}\ldots\\4\alpha ed\un{d}\ldots\end{array}\right.\\\stackrel{\alpha = b}{\leftarrow}4\un{b}eac\ldots\\\stackrel{\alpha = c}{\leftarrow}3\un{a}eac\ldots\end{array}\right.\end{array}\right..\end{equation} Finally, after calculating the new RHS's thus $2\un{b}aec\ldots\to 4\_caec\ldots$ and $2\un{c}aec\ldots\to 3\_bccc\ldots$ and truncating to $k=3$ symbols and filling in the LHS's gives the second major row of Table~\ref{irr_3r}.
\fontsize{10}{10}\selectfont
\begin{longtable}{@{\hspace{0.2em}}c@{\hspace{0.2em}}|l@{\hspace{0.5em}}l@{\hspace{0.5em}}l|l@{\hspace{0.5em}}l@{\hspace{0.5em}}l}
\caption{A few outline IRRs of length $n$ and their derived outline IRR of length $n+1$, with the unknown symbols on the right, for $k=3$ symbols\label{irr_3r}}\\
row\# in&\multicolumn{3}{c|}{IRR($n$)}&\multicolumn{3}{c}{IRR($n+1$)}\\
table \ref{irr_2r}&Origin& LHS&RHS&Origin&LHS&RHS\\
\hline
$9$&$2\un{a}dc\ldots$&$\{1,2\}cbd\ldots$&$2\_aec\ldots$&$1\un{d}ad\ldots$&$xbcb\ldots$&$4\_cae\ldots$\\
&&&&$1\un{e}ad\ldots$&$xbcb\ldots$&$4\_cae\ldots$\\
&&&&$1\un{d}da\ldots$&$xbcb\ldots$&$4\_cae\ldots$\\
&&&&$1\un{e}da\ldots$&$xbcb\ldots$&$4\_cae\ldots$\\
&&&&$2\alpha dc\un{e}\ldots$&$x\alpha cbd\ldots$&$RHS$\\\hline
$12$&$2\un{a}ec\ldots$&$\{1,2\}cbd\ldots$&$2\_aec\ldots$&$4\un{b}ea\ldots$&$xbcb\ldots$&$4\_cae\ldots$\\
&&&&$3\un{a}ea\ldots$&$xccb\ldots$&$3\_bcc\ldots$\\
&&&&$3\alpha aa\un{d}\ldots$&$x\alpha cbd\ldots$&$RHS$\\
&&&&$4\alpha aa\un{d}\ldots$&$x\alpha cbd\ldots$&$RHS$\\
&&&&$3\alpha ed\un{d}\ldots$&$x\alpha cbd\ldots$&$RHS$\\
&&&&$4\alpha ed\un{d}\ldots$&$x\alpha cbd\ldots$&$RHS$\\\hline
$15$&$2\un{c}da\ldots$&$\{1,2\}dbc\ldots$&$5\_cca\ldots$&$4\un{e}cc\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$4\un{e}ec\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$5\un{c}ad\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$5\un{e}ad\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$1\un{d}cd\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}cd\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{d}aa\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}aa\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$4\un{b}cd\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$3\un{e}ad\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{d}ab\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}ab\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$3\un{a}cd\ldots$&$xcdb\ldots$&$1dbd\ldots$\\
&&&&$4\un{c}ad\ldots$&$xcdb\ldots$&$1dbd\ldots$\\
&&&&$1\alpha ac\un{c}\ldots$&$x\alpha dbc\ldots$&$RHS$\\
&&&&$1\alpha cd\un{c}\ldots$&$x\alpha dbc\ldots$&$RHS$\\
&&&&$5\alpha cd\un{d}\ldots$&$x\alpha dbc\ldots$&$RHS$\\
&&&&$1\alpha ed\un{c}\ldots$&$x\alpha dbc\ldots$&$RHS$\\
&&&&$5\alpha ed\un{d}\ldots$&$x\alpha dbc\ldots$&$RHS$\\\hline
$15$&$2\un{c}dd\ldots$&$1dba\ldots$&$5\_cca\ldots$&$5\un{c}ad\ldots$&$1adb\ldots$&$2\_ecc\ldots$\\
&&&&$4\un{e}cc\ldots$&$1adb\ldots$&$2\_ecc\ldots$\\
&&&&$5\un{e}ad\ldots$&$1adb\ldots$&$2\_ecc\ldots$\\
&&&&$4\un{e}ec\ldots$&$1adb\ldots$&$2\_ecc\ldots$\\
&&&&$1\un{d}cd\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}cd\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{d}ab\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}ab\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{d}aa\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}aa\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$4\un{b}cd\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$3\un{e}ad\ldots$&$1bdb\ldots$&$3\_ecc\ldots$\\
&&&&$3\un{a}cd\ldots$&$1cdb\ldots$&$2dba\ldots$\\
&&&&$4\un{c}ad\ldots$&$1cdb\ldots$&$2dba\ldots$\\
&&&&$1\alpha cd\un{b}\ldots$&$1\alpha dba\ldots$&$RHS$\\
&&&&$1\alpha ed\un{b}\ldots$&$1\alpha dba\ldots$&$RHS$\\\hline
$15$&$2\un{c}dd\ldots$&$\{1,2\}dba\ldots$&$5\_ccb\ldots$&$5\un{c}ad\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$4\un{e}cc\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$5\un{e}ad\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$4\un{e}ec\ldots$&$xadb\ldots$&$2\_ecc\ldots$\\
&&&&$1\un{d}cd\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}cd\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{d}ab\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}ab\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{d}aa\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$1\un{e}aa\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$4\un{b}cd\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$3\un{e}ad\ldots$&$xbdb\ldots$&$3\_ecc\ldots$\\
&&&&$3\un{a}cd\ldots$&$xcdb\ldots$&$5\_cec\ldots$\\
&&&&$4\un{c}ad\ldots$&$xcdb\ldots$&$5\_cec\ldots$\\
&&&&$1\alpha cd\un{b}\ldots$&$x\alpha dba\ldots$&$RHS$\\
&&&&$1\alpha ed\un{b}\ldots$&$x\alpha dba\ldots$&$RHS$\\\hline
$16$&$2\un{c}dc\ldots$&$\{1,2\}dbd\ldots$&$5\_cec\ldots$&$4\un{e}cc\ldots$&$xadb\ldots$&$2\_ece\ldots$\\
&&&&$5\un{e}ad\ldots$&$xadb\ldots$&$2\_ece\ldots$\\
&&&&$5\un{c}ad\ldots$&$xadb\ldots$&$2\_ece\ldots$\\
&&&&$4\un{e}ec\ldots$&$xadb\ldots$&$2\_ece\ldots$\\
&&&&$1\un{d}cd\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$1\un{e}cd\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$1\un{d}aa\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$1\un{e}aa\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$1\un{d}ab\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$1\un{e}ab\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$4\un{b}cd\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$3\un{e}ad\ldots$&$xbdb\ldots$&$3\_ece\ldots$\\
&&&&$3\un{a}cd\ldots$&$xcdb\ldots$&$5\_ccc\ldots$\\
&&&&$4\un{c}ad\ldots$&$xcdb\ldots$&$5\_ccc\ldots$\\
&&&&$2\alpha ac\un{e}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
&&&&$2\alpha cd\un{e}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
&&&&$2\alpha cd\un{b}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
&&&&$3\alpha cd\un{b}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
&&&&$2\alpha ed\un{e}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
&&&&$2\alpha ed\un{b}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
&&&&$3\alpha ed\un{b}\ldots$&$x\alpha dbd\ldots$&$RHS$\\
\end{longtable}
\fontsize{12}{14}\selectfont
This table is incomplete because it would take up too much space if written out in full like this.

If these results are put into groups where just the symbol furthest from the $\alpha$ (i.e. on the right here) is different in the origins of the IRR($n$) outlines, the sets of origins of the corresponding IRR($n+1$) outlines for each value of $\alpha$ are the same in each member of the group. This is because in the backward search, the pointer reaches the symbols that differ at the point where the backward search algorithm terminates, and the symbols that differ are truncated off the result. For example comparing the backward search algorithm applied to $2\alpha\un{c}dd\ldots$ and $2\alpha\un{c}dc\ldots$, the results will be identical, apart from the change in the last symbol, up to the point where the pointer first reaches the right hand end of the given symbols. The last backward step will be for $\_d\ldots$ in the first case and $\_c\ldots$ in the second thus leaving identical results apart from the last symbol that is then truncated off. 

As a result of this, the essential content of the complete version of Table~\ref{irr_3r} (for abbreviated length $k=3$) can be expressed much more compactly by giving just\begin{enumerate}
\item the list of outline IRR($n$) triplets ($A'$)
\item for each symbol $\alpha$ and distinct origin of the IRR($n$) outlines abbreviated further (now having length $k-1$) by deleting the symbol opposite the $\alpha$ ($\beta$), the set of corresponding origins of IRR($n+1$) outlines (length $k$) 
\item For each distinct abbreviated origin of the IRR($n$) outlines and $\beta$, which RHS's of the IRR($n$) outlines applies. \item for each symbol $\alpha$ and distinct RHS of IRR($n$) outlines of length $k$, the RHS of IRR($n+1$) outlines of length $k$\item for each distinct origin of IRR($n$) outlines length $k$, the set of all new non-IRR triplet origins of length $k+1$.
\end{enumerate} This assumes that the user can fill in the LHS's of IRR($n+1$) themselves. Table irr origins contain the information in (2) for Tables \ref{irr_2r} and \ref{irr_2r.2}.

Table~\ref{ext_irr3_triplets} contains the initial list $A'$ for $k=3$ which must be extended to closure. Tables \ref{origins_3} \ref{RHS_update_3} and \ref{exceptions_3} contain the information in (2) (3) and (4) respectively for $k=3$ after closure has been applied. This would be done by including in the IRR($n$) column of Table~\ref{irr_3r} those IRR($n+1$) that are not already there, unless the IRR($n+1$) matches an IRR($n$) in Table irr origins and completing the row of the Table~\ref{irr_3r} etc. until there are no further changes. The point of the last exception is to ensure that any IRR triplet represented in the completion of Table~\ref{irr_3r} can have $F$ applied in accordance with either Table irr origins or the completion of Table~\ref{irr_3r} i.e. Tables \ref{origins_3} \ref{RHS_update_3} and \ref{exceptions_3}. 

How do these 3 tables represent the essential content of the completion of Table~\ref{irr_3r}? Table~\ref{origins_3} is the most complicated and is divided into major rows by horizontal lines. Each major row starts from a set of origin CS's given by the top left CS with the values of $\beta$ indicated in the second column. Applying the backward search algorithm starting from the origin CS's with the arbitrary symbol $\alpha$ added adjacent to the pointer gives a search tree ending with CS's having the pointer at either end of the string, unless condition 3 is reached when no further computation can be done. If the pointer ends in condition 1 with the pointer where $\alpha$ was, the results (the new origins) truncated to the same number of symbols ($k=3$) are listed in Table~\ref{origins_3} under the appropriate value of $\alpha$. If the computation ends with condition 2 i.e. the pointer ends up at the opposite end from the $\alpha$, the result appears in Table~\ref{exceptions_3}. The RHS's corresponding to the original CS's are listed below them. Note that there is not a one-to-one correspondence between the different origins and the RHS's, and not every combination of $\beta$ and RHS is necessarily possible together. This is detail not contained in Table~\ref{origins_3} and is relatively unimportant because every origin CS and symbol $\alpha$ gives rise to the same set of new origins for IRR($n+1$) which are those listed. The new RHS's of IRR($n+1$) depend only on the the RHS of IRR($n$) and are therefore listed separately in Table~\ref{RHS_update_3}. Similarly for the cases that are the new exceptions i.e. where the pointer goes away from the $\alpha$ in the backward search algorithm, then new origin depends only on the origin of IRR($n$) and are listed in Table~\ref{exceptions_3}.



\fontsize{10}{10}\selectfont
\begin{longtable}{lllllll}
\caption{Table of extended IRR triplets ($A$) and ($A'$)\label{ext_irr3_triplets}}\\
&\multicolumn{3}{c}{triplet IRR($n$) with $k=2$}&\multicolumn{3}{c}{extended triplet with $k=3$}\\
$9$& $2\un{a}d\ldots$&$\{1,2\}cb\ldots$&$2\_ae\ldots$&$2\un{a}dc\ldots$&$xcbd\ldots$&$2\_aec\ldots$\\\hline
$12$& $2\un{a}e\ldots$&$\{1,2\}cb\ldots$&$2\_ae\ldots$&$2\un{a}ec\ldots$&$xcbd\ldots$&$2\_aec\ldots$\\\hline
$15$& $2\un{c}d\ldots$&$\{1,2\}db\ldots$&$5\_cc\ldots$&$2\un{c}da\ldots$&$\{1,2\}dbc\ldots$&$5\_cca\ldots$\\
&&&&$2\un{c}dd\ldots$&$1dba\ldots$&$5\_cca\ldots$\\
&&&&$2\un{c}dd\ldots$&$\{1,2\}dba\ldots$&$5\_ccb\ldots$\\\hline
$16$&$2\un{c}d\ldots$&$\{1,2\}db\ldots$&$5\_ce\ldots$&$2\un{c}dc\ldots$&$\{1,2\}dbd\ldots$&$5\_cec\ldots$\\\hline
$17$&$2\un{c}e\ldots$&$\{1,2\}db\ldots$&$5\_cc\ldots$&$2\un{c}ea\ldots$&$\{1,2\}dbc\ldots$&$5\_cca\ldots$\\\hline
&&&&$2\un{c}ed\ldots$&$1dba\ldots$&$5\_cca\ldots$\\
&&&&$2\un{c}ed\ldots$&$\{1,2\}dba\ldots$&$5\_ccb\ldots$\\
$18$&$2\un{c}e\ldots$&$\{1,2\}db\ldots$&$5\_ce\ldots$&$2\un{c}ec\ldots$&$\{1,2\}dbd\ldots$&$5\_cec\ldots$\\\hline
$19$&$2\un{d}d\ldots$&$\{1,2\}ab\ldots$&$3\_bc\ldots$&$2\un{d}dd\ldots$&$1aba\ldots$&$3\_bca\ldots$\\
&&&&$2\un{d}dd\ldots$&$\{1,2\}aba\ldots$&$3\_bcb\ldots$\\
&&&&$2\un{d}da\ldots$&$\{1,2\}abc\ldots$&$3\_bca\ldots$\\\hline
$21$&$2\un{d}e\ldots$&$\{1,2\}ab\ldots$&$3\_bc\ldots$&$2\un{d}ea\ldots$&$\{1,2\}abc\ldots$&$3\_bca\ldots$\\
&&&&$2\un{d}ed\ldots$&$1aba\ldots$&$3\_bca\ldots$\\
&&&&$2\un{d}ed\ldots$&$\{1,2\}aba\ldots$&$3\_bcb\ldots$\\\hline
$23$&$3\un{a}b\ldots$&$4cb\ldots$&$2\_ae\ldots$\\\hline
$24$&$3\un{a}b\ldots$&$4cb\ldots$&$3\_bc\ldots$&$3\un{a}bb\ldots$&$4cbb\ldots$&$3\_bcc\ldots$\\
&&&&$3\un{a}be\ldots$&$4cba\ldots$&$3\_bcc\ldots$\\\hline
$27$&$3\un{a}c\ldots$&$\{3,4\}cc\ldots$&$2\_ab\ldots$&$3\un{a}ce\ldots$&$3ccb\ldots$&$2\_abc\ldots$\\
&&&&$3\un{a}ca\ldots$&$4ccc\ldots$&$2\_abc\ldots$\\\hline
$28$&$3\un{a}c\ldots$&$3cc\ldots$&$3\_bc\ldots$&$3\un{a}ce\ldots$&$3ccb\ldots$&$3\_bcc\ldots$\\\hline
$30$&$3\un{a}e\ldots$&$5ca\ldots$&$2\_ab\ldots$\\\hline
$32$&$3\un{e}a\ldots$&$\{3,4,5\}bc\ldots$&$4\_ca\ldots$&$3\un{e}ab\ldots$&$4bcb\ldots$&$4\_cae\ldots$\\
&&&&$3\un{e}ac\ldots$&$\{3,4\}bcc\ldots$&$4\_cab\ldots$\\
&&&&$3\un{e}ae\ldots$&$5bca\ldots$&$4\_cab\ldots$\\\hline
$33$&$3\un{e}a\ldots$&$\{3,4\}bc\ldots$&$4\_cb\ldots$&$3\un{e}ab\ldots$&$4bcb\ldots$&$4\_cbc\ldots$\\
&&&&$3\un{e}ac\ldots$&$3bcc\ldots$&$4\_cbc\ldots$\\\hline
$34$&$3\un{e}e\ldots$&$3bb\ldots$&$4\_ce\ldots$\\\hline
$42$&$4\un{b}c\ldots$&$\{3,4\}bc\ldots$&$4\_ca\ldots$&$4\un{b}ca\ldots$&$\{3,4\}bcc\ldots$&$4\_cab\ldots$\\
&&&&$4\un{b}ce\ldots$&$3bcb\ldots$&$4\_cae\ldots$\\\hline
$43$&$4\un{b}c\ldots$&$\{3,4\}bc\ldots$&$4\_cb\ldots$&$4\un{b}ca\ldots$&$4bcc\ldots$&$4\_cbc\ldots$\\
&&&&$4\un{b}ce\ldots$&$3bcb\ldots$&$4\_cbc\ldots$\\\hline
$46$&$4\un{c}a\ldots$&$\{3,4\}cc\ldots$&$2\_ab\ldots$&$4\un{c}ab\ldots$&$4ccb\ldots$&$2\_abc\ldots$\\
&&&&$4\un{c}ac\ldots$&$3ccc\ldots$&$2\_abc\ldots$\\\hline
$47$&$4\un{c}a\ldots$&$4cc\ldots$&$3\_bc\ldots$&$4\un{c}ab\ldots$&$4ccb\ldots$&$3\_bcc\ldots$\\\hline
$53$&$4\un{e}c\ldots$&$4aa\ldots$&$2\_ec\ldots$&$4\un{e}ca\ldots$&$4aac\ldots$&$2\_ecc\ldots$\\\hline
$9$&$1\ldots d\un{b}$&$\{3,4,5\}\ldots cd$&$1\ldots ba\_$&$1\ldots dd\un{b}$&$\{3,4\}\ldots acd$&$1\ldots aba\_$\\\hline
$10$&$1\ldots d\un{b}$&$\{3,4\}\ldots cd$&$1\ldots bd\_$&$1\ldots bd\un{b}$&$\{3,4\}\ldots ecd$&$1\ldots cbd\_$\\\hline
$11$&$1\ldots d\un{b}$&$\{2,3,4,5\}\ldots cd$&$2\ldots cb\_$&$1\ldots ad\un{b}$&$\{3,4\}\ldots ecd$&$2\ldots bcb\_$\\
&&&&$1\ldots bd\un{b}$&$\{2,3,4,5\}\ldots ecd$&$2\ldots bcb\_$\\\hline
$12$&$1\ldots d\un{b}$&$\{2,3,4,5\}\ldots cd$&$2\ldots db\_$&$1\ldots ad\un{b}$&$\{2,3,4,5\}\ldots ecd$&$2\ldots bdb\_$\\
&&&&$1\ldots bd\un{b}$&$\{2,3,4,5\}\ldots ecd$&$2\ldots bdb\_$\\
&&&&$1\ldots dd\un{b}$&$\{2,3,4,5\}\ldots acd$&$2\ldots bdb\_$\\
&&&&$1\ldots dd\un{b}$&$\{2,3,4,5\}\ldots acd$&$2\ldots cdb\_$\\
&&&&$1\ldots bd\un{b}$&$3\ldots ecd$&$2\ldots cdb\_$\\\hline
$17$&$1\ldots c\un{c}$&$\{2,3,4,5\}\ldots aa$&$1\ldots bc\_$&$1\ldots bc\un{c}$&$\{2,3,4,5\}\ldots caa$&$1\ldots abc\_$\\
&&&&$1\ldots ec\un{c}$&$\{2,3,4,5\}\ldots caa$&$1\ldots abc\_$\\\hline
$18$&$1\ldots c\un{c}$&$\{2,3,4,5\}\ldots aa$&$2\ldots db\_$&$1\ldots bc\un{c}$&$\{2,3,4,5\}\ldots caa$&$2\ldots bdb\_$\\
&&&&$1\ldots ec\un{c}$&$\{2,3,4,5\}\ldots caa$&$2\ldots bdb\_$\\\hline
$19$&$1\ldots c\un{c}$&$\{3,4\}\ldots aa$&$3\ldots bc\_$&$1\ldots bc\un{c}$&$4\ldots caa$&$3\ldots dbc\_$\\
&&&&$1\ldots bc\un{c}$&$\{3,4\}\ldots caa$&$3\ldots abc\_$\\
&&&&$1\ldots ec\un{c}$&$\{3,4\}\ldots caa$&$3\ldots abc\_$\\\hline
$20$&$1\ldots d\un{c}$&$\{3,4,5\}\ldots ca$&$1\ldots bc\_$&$1\ldots dd\un{c}$&$\{3,4\}\ldots aca$&$1\ldots abc\_$\\\hline
$21$&$1\ldots d\un{c}$&$\{2,3,4,5\}\ldots ca$&$2\ldots ab\_$&$1\ldots ad\un{c}$&$\{2,3,4,5\}\ldots eca$&$2\ldots bab\_$\\
&&&&$1\ldots bd\un{c}$&$\{2,3,4,5\}\ldots eca$&$2\ldots bab\_$\\
&&&&$1\ldots dd\un{c}$&$\{2,3,4,5\}\ldots aca$&$2\ldots bab\_$\\\hline
$22$&$1\ldots d\un{c}$&$\{2,3,4,5\}\ldots ca$&$2\ldots db\_$&$1\ldots ad\un{c}$&$\{3,4\}\ldots eca$&$2\ldots bdb\_$\\
&&&&$1\ldots bd\un{c}$&$\{2,3,4,5\}\ldots eca$&$2\ldots bdb\_$\\\hline
$23$&$1\ldots d\un{c}$&$3\ldots ca$&$3\ldots bc\_$&$1\ldots bd\un{c}$&$3\ldots eca$&$3\ldots abc\_$\\\hline
$24$&$1\ldots d\un{c}$&$\{3,4\}\ldots ca$&$4\ldots ac\_$&$1\ldots bd\un{c}$&$\{3,4\}\ldots eca$&$4\ldots aac\_$\\\hline
$25$&$1\ldots d\un{c}$&$\{2,3,4,5\}\ldots ca$&$4\ldots cc\_$&$1\ldots dd\un{c}$&$\{2,3,4,5\}\ldots aca$&$4\ldots ccc\_$\\\hline
$36$&$2\ldots b\un{e}$&$\{2,3,4,5\}\ldots cc$&$1\ldots bd\_$&$2\ldots db\un{e}$&$\{2,3,4,5\}\ldots ccc$&$1\ldots abd\_$\\
&&&&$2\ldots db\un{e}$&$\{3,4\}\ldots ccc$&$1\ldots dbd\_$\\
&&&&$2\ldots ab\un{e}$&$\{2,3,4,5\}\ldots bcc$&$1\ldots abd\_$\\\hline
$37$&$2\ldots b\un{e}$&$\{3,4\}\ldots cc$&$2\ldots ab\_$&$2\ldots ab\un{e}$&$\{3,4\}\ldots bcc$&$2\ldots bab\_$\\
&&&&$2\ldots db\un{e}$&$3\ldots ccc$&$2\ldots cab\_$\\\hline
$38$&$2\ldots b\un{e}$&$4\ldots cc$&$2\ldots db\_$&&&\\\hline
$48$&$3\ldots a\un{b}$&$\{2,3,4,5\}\ldots bc$&$1\ldots bd\_$&$3\ldots ba\un{b}$&$\{3,4\}\ldots cbc$&$1\ldots abd\_$\\
&&&&$3\ldots ca\un{b}$&$\{2,3,4,5\}\ldots abc$&$1\ldots dbd\_$\\
&&&&$3\ldots da\un{b}$&$\{2,3,4,5\}\ldots cbc$&$1\ldots abd\_$\\
&&&&$3\ldots da\un{b}$&$\{2,3,4,5\}\ldots cbc$&$1\ldots dbd\_$\\\hline
$49$&$3\ldots a\un{b}$&$\{2,3,4,5\}\ldots bc$&$2\ldots ab\_$&$3\ldots ba\un{b}$&$\{2,3,4,5\}\ldots cbc$&$2\ldots bab\_$\\
&&&&$3\ldots ca\un{b}$&$\{2,3,4,5\}\ldots cbc$&$2\ldots bab\_$\\
&&&&$3\ldots da\un{b}$&$\{3,4,5\}\ldots cbc$&$2\ldots bab\_$\\\hline
$50$&$3\ldots a\un{b}$&$\{3,4\}\ldots bc$&$3\ldots bc\_$&$3\ldots ca\un{b}$&$\{3,4\}\ldots abc$&$3\ldots cbc\_$\\
&&&&$3\ldots da\un{b}$&$3\ldots cbc$&$3\ldots cbc\_$\\\hline
$57$&$3\ldots b\un{c}$&$\{2,3,4,5\}\ldots ca$&$1\ldots bc\_$&$3\ldots ab\un{c}$&$\{2,3,4,5\}\ldots bca$&$1\ldots abc\_$\\
&&&&$3\ldots db\un{c}$&$\{2,3,4,5\}\ldots cca$&$1\ldots abc\_$\\
&&&&$3\ldots db\un{c}$&$\{3,4\}\ldots cca$&$1\ldots dbc\_$\\\hline
$58$&$3\ldots b\un{c}$&$\{2,3,4,5\}\ldots ca$&$2\ldots ab\_$&$3\ldots ab\un{c}$&$\{2,3,4,5\}\ldots bca$&$2\ldots bab\_$\\
&&&&$3\ldots db\un{c}$&$\{3,4,5\}\ldots cca$&$2\ldots bab\_$\\ \hline
$59$&$3\ldots b\un{c}$&$4\ldots ca$&$4\ldots ac\_$&&&\\\hline
$60$&$3\ldots b\un{c}$&$\{3,4\}\ldots ca$&$4\ldots cc\_$&$3\ldots ab\un{c}$&$\{3,4\}\ldots bca$&$4\ldots bcc\_$\\
&&&&$3\ldots db\un{c}$&$3\ldots cca$&$4\ldots ccc\_$\\\hline
$65$&$3\ldots a\un{d}$&$\{3,4\}\ldots ec$&$1\ldots bc\_$&$3\ldots ba\un{d}$&$\{3,4\}\ldots cec$&$1\ldots abc\_$\\
&&&&$3\ldots ea\un{d}$&$\{3,4\}\ldots cec$&$1\ldots abc\_$\\\hline
$66$&$3\ldots a\un{d}$&$\{2,3,4,5\}\ldots ec$&$1\ldots bd\_$&$3\ldots ba\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots dbd\_$\\
&&&&$3\ldots ea\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots dbd\_$\\\hline
$68$&$3\ldots b\un{d}$&$\{2,3,4,5\}\ldots ec$&$1\ldots bc\_$&$3\ldots bb\un{d}$&$\{3,4\}\ldots cec$&$1\ldots abc\_$\\
&&&&$3\ldots db\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots abc\_$\\\hline
$69$&$3\ldots b\un{d}$&$\{2,3,4,5\}\ldots ec$&$1\ldots bd\_$&$3\ldots bb\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots dbd\_$\\
&&&&$3\ldots db\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots cbd\_$\\
&&&&$3\ldots db\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots dbd\_$\\
&&&&$3\ldots cb\un{d}$&$\{2,3,4,5\}\ldots aec$&$1\ldots cbd\_$\\\hline
$70$&$3\ldots b\un{d}$&$\{3,4\}\ldots ec$&$3\ldots aa\_$&$3\ldots cb\un{d}$&$\{3,4\}\ldots aec$&$3\ldots caa\_$\\
&&&&$3\ldots db\un{d}$&$3\ldots cec$&$3\ldots caa\_$\\\hline
$71$&$3\ldots b\un{d}$&$3\ldots ec$&$4\ldots cc\_$&&&\\\hline
$77$&$4\ldots b\un{a}$&$\{3,4\}\ldots cb$&$2\ldots ab\_$&$4\ldots ab\un{a}$&$\{3,4\}\ldots bcb$&$2\ldots bab\_$\\
&&&&$4\ldots db\un{a}$&$3\ldots ccb$&$2\ldots cab\_$\\\hline
$78$&$4\ldots b\un{a}$&$\{2,3,4,5\}\ldots cb$&$3\ldots bc\_$&$4\ldots db\un{a}$&$\{2,3,4,5\}\ldots ccb$&$3\ldots abc\_$\\
&&&&$4\ldots db\un{a}$&$\{3,4\}\ldots ccb$&$3\ldots dbc\_$\\
&&&&$4\ldots ab\un{a}$&$\{2,3,4,5\}\ldots bcb$&$3\ldots abc\_$\\\hline
$79$&$4\ldots c\un{a}$&$\{2,3,4,5\}\ldots ab$&$2\ldots db\_$&$4\ldots bc\un{a}$&$\{2,3,4,5\}\ldots cab$&$2\ldots bdb\_$\\
&&&&$4\ldots ec\un{a}$&$\{2,3,4,5\}\ldots cab$&$2\ldots bdb\_$\\\hline
$80$&$4\ldots c\un{a}$&$\{2,3,4,5\}\ldots ab$&$3\ldots bc\_$&$4\ldots bc\un{a}$&$\{2,3,4,5\}\ldots cab$&$3\ldots abc\_$\\
&&&&$4\ldots ec\un{a}$&$\{2,3,4,5\}\ldots cab$&$3\ldots abc\_$\\\hline
$81$&$4\ldots c\un{a}$&$\{3,4\}\ldots ab$&$4\ldots cb\_$&$4\ldots bc\un{a}$&$4\ldots cab$&$4\ldots acb\_$\\
&&&&$4\ldots bc\un{a}$&$\{3,4\}\ldots cab$&$4\ldots ccb\_$\\
&&&&$4\ldots ec\un{a}$&$\{3,4\}\ldots cab$&$4\ldots ccb\_$\\\hline
$91$&$4\ldots b\un{d}$&$\{2,3,4,5\}\ldots ec$&$1\ldots bc\_$&$4\ldots bb\un{d}$&$\{3,4\}\ldots cec$&$1\ldots abc\_$\\
&&&&$4\ldots db\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots abc\_$\\\hline
$92$&$4\ldots b\un{d}$&$\{2,3,4,5\}\ldots ec$&$1\ldots bd\_$&$4\ldots bb\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots dbd\_$\\
&&&&$4\ldots cb\un{d}$&$\{2,3,4,5\}\ldots aec$&$1\ldots cbd\_$\\
&&&&$4\ldots db\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots cbd\_$\\
&&&&$4\ldots db\un{d}$&$\{2,3,4,5\}\ldots cec$&$1\ldots dbd\_$\\\hline
$93$&$4\ldots b\un{d}$&$\{3,4\}\ldots ec$&$3\ldots aa\_$&$4\ldots cb\un{d}$&$\{3,4\}\ldots aec$&$3\ldots caa\_$\\
&&&&$4\ldots db\un{d}$&$3\ldots cec$&$3\ldots caa\_$\\\hline
$94$&$4\ldots b\un{d}$&$3\ldots ec$&$4\ldots cc\_$&&&\\\hline
$125$&$5\ldots a\un{d}$&$\{2,3,4,5\}\ldots ba$&$1\ldots bc\_$&$5\ldots ba\un{d}$&$\{3,4\}\ldots cba$&$1\ldots abc\_$\\
&&&&$5\ldots ca\un{d}$&$\{2,3,4,5\}\ldots aba$&$1\ldots dbc\_$\\
&&&&$5\ldots da\un{d}$&$\{2,3,4,5\}\ldots cba$&$1\ldots abc\_$\\
&&&&$5\ldots da\un{d}$&$\{2,3,4,5\}\ldots cba$&$1\ldots dbc\_$\\\hline
$126$&$5\ldots a\un{d}$&$\{3,4\}\ldots ba$&$3\ldots bc\_$&$5\ldots ca\un{d}$&$\{3,4\}\ldots aba$&$3\ldots abc\_$\\
&&&&$5\ldots da\un{d}$&$3\ldots cba$&$3\ldots abc\_$\\ \hline
$127$&$5\ldots a\un{d}$&$\{2,3,4,5\}\ldots ba$&$4\ldots cc\_$&$5\ldots ba\un{d}$&$\{2,3,4,5\}\ldots cba$&$4\ldots bcc\_$\\
&&&&$5\ldots ca\un{d}$&$\{2,3,4,5\}\ldots aba$&$4\ldots bcc\_$\\
&&&&$5\ldots da\un{d}$&$\{2,3,4,5\}\ldots cba$&$4\ldots bcc\_$\\\hline
\end{longtable}
\fontsize{12}{14}\selectfont


*********************
The following is a procedure for obtaining from a member of $IRR(n,k)$, the corresponding sets of members of $IRR(n+1,k',k+1)$ and $IRR(n,k,k+1)$ for each value of $\alpha$. Either or both of these could be empty.
Start from a typical member of $IRR(n,k)$ that can be written as
\begin{equation}\label{abb_tr_rel}st\ldots sy_{1}\ldots sy_{k-1}\un{sy_k}\to st'\ldots sy'_{1}\ldots sy'_k\to RHS.\end{equation} where the computation of the RHS is straightforward and will be assumed to be done in all the following. Therefore $st\ldots sy_{1}\ldots sy_{k-1}\un{sy_k}$ determines $st'\ldots sy'_{1}\ldots sy'_k$ uniquely and these sequences must appear together in all members of $IRR(n,k)$. This fact can be used to reduce duplication of information in tables analogous to Tables \ref{irr_2r} and \ref{irr_2r.2}.

In the derivation of the $IRR(n+1,k')$, for some value of $k'\le n$, from this according to the method involved in Theorem~\ref{irr_ind_thm} (function $F$), if a branch of the backward search algorithm with a value of $\alpha$ ends in condition 1 this can be represented as
\begin{equation}\label{eq128}st\ldots sy_1\ldots sy_{k-1}\un{sy_k}\alpha\leftarrow st^*\ldots sy^*_1\ldots \un{sy^*_{k+1}}.
\end{equation}
This is a necessary and sufficient condition for a derived IRR triplet to be found.
Suppose the pointer does not reach $sy_1$ so the minimum length of tape needed for the backward search is $k'$ where $k'\le k$ because otherwise this allows the possibility that the backward search algorithm ends in condition 2.
Therefore $sy_1$ is unaffected and $sy_1=sy^*_1$. (so $sy_1$ could have several different values without affecting anything else i.e. these results can be put into groups such that within each group the results differ only in the value of $sy_1$. For each member of the group the range of $\alpha$ and the origins abbreviated to length $k$ are the same ($sy^*_1$ is removed)). 
Therefore the typical member of $IRR(n+1,k',k+1)$ derived from this is\begin{equation}st^*\ldots sy^*_1\ldots sy^*_{k-k'+2}\ldots \un{sy^*_{k+1}}\to st'\ldots sy'_1\ldots sy'_{k-k'+2}\ldots sy'_k\alpha\to RHS.\end{equation}
If during the derivation of \ref{eq128} the pointer does not reach the symbol $sy^*_2$ the result would presumably have been found already from the results for shorter strings (check).
If a branch of the backward search algorithm for the above case with a particular value of $\alpha$ does reach $sy_1$ we get say
\begin{equation}\label{129}st\ldots sy_1\ldots sy_{k-1}\un{sy_k}\alpha\leftarrow st''\ldots\un{sy_1}\ldots sy''_k\alpha\end{equation} because now $\alpha$ is not reached by the pointer and so is unchanged. In this calculation, when the pointer reaches $sy_1$ the backward search algorithm stops because another symbol is needed to obtain all possible reverse TM steps from there so this symbol is not changed, as indicated.
No member of $IRR(n+1,k')$ results (because no origin was found and so the LHS was not verified as being reachable) and instead it is necessary to go back by finding what triplet $T\in IRR(n-1,k_3,k)$ (that may not be unique) gave rise to \ref{abb_tr_rel} via $F$, and deriving the extended \ref{abb_tr_rel} (this is in $IRR(n,k,k+1)$ and truncates to \ref{abb_tr_rel}) from $T$ without truncating the symbol on the left. Then apply $F$ to the extended \ref{abb_tr_rel}.

The triplet $T$ is obtained by first obtaining $T'\in IRR(n-1,k_1,k_2)$, that may not be unique, such that $F$ applied to it yields \ref{abb_tr_rel}. The origin of $T'$ is obtained by forward computation from the origin of \ref{abb_tr_rel} and finishing when the pointer reaches the symbol at $sy_{k-1}$. The first TM step must be to the left reaching that point, printing symbol $\alpha$ where $sy_k$ is. This computation must not have the pointer reach its starting location again, nor the point where $sy_1$ is, because this is the backward search algorithm running in reverse that would stop in either of these situations. This computation could happen in a lot different ways because the endpoint could be reached by multiple left and right moving sweeps of the pointer. After this, the symbol at the right, that is $\alpha$ is deleted. If there is cycling, the computation must back-track to where the endpoint was last reached. The LHS of $T'$ must be the LHS of \ref{abb_tr_rel} with the last symbol on the right removed, that is $\alpha$. 
The RHS of $T'$ must be obtained by running the TM backwards from the RHS of \ref{abb_tr_rel} such that the pointer ends up one place to the left of where it started. This can give non-unique results.
Then $T$ must match $T'$, where $T$ has already been found, so $T$ may not be unique.
Then for each of these $T$'s search for an $\alpha$ such that when $F$ is applied, it generates a result that matches \ref{abb_tr_rel} in $IRR(n,k,k+1)$ i.e. without truncation. Then the computation can proceed from there, which may or may not give a result in $IRR(n+1,k+1)$ etc..
%\end{alg}

I think the general procedure for obtaining the means of getting the IRR($n$) recursively is something like the following:

After the IRR(3) have been obtained:
Obtain IRR(3,2) Table~\ref{ind1} done.
From IRR(3,2) obtain IRR(4,2) (Tables \ref{irr_2r} and \ref{irr_2r.2})
From those entries in IRR(4,2) that could not be completely done because of the restriction on the tape length for calculating all the origins, do this again starting with those IRR(3,2) but keeping the extra symbol giving IRR(4,3). This should account for all the IRR(4) because in running the backward search algorithm to get all the origins from the IRR(3) (starting from $xx\un{x}\alpha$), the furthest left you have to go from the $\alpha$ is 2 spaces because the if the pointer goes one step further it reaches the end and the backward search algorithm stops ($k=3$). With only one symbol deleted, all the values of $\alpha$ can be obtained from the backward search algorithm because if the pointer gets to the end the search stops.
From these IRR(4,3) obtain IRR(5,3) in analogy with how Tables \ref{irr_2r} and \ref{irr_2r.2} were obtained.
Again, if some of these calculations cannot be completed properly obtain the IRR(5,4) by retaining the extra symbol.
... etc.

**************
\fontsize{10}{10}\selectfont
\begin{longtable}{c|l@{\hspace{0.5em}}l|c|l@{\hspace{0.5em}}l}
\caption{Outline IRRs of length $n$ and their derived outline IRR of length $n+1$, with the unknown symbols on the left.\label{irr_2r.2}}\\
set&\multicolumn{2}{c|}{IRR($n$)}&$\alpha$&\multicolumn{2}{c}{IRR($n+1$)}\\
number&Origin&RHS&&Origin&RHS\\
\hline
$1$&$1\ldots b\un{a}$&$1\ldots ba\_$&$\emptyset$&$\emptyset$&\\\hline
$2$&$1\ldots b\un{a}$&$1\ldots bd\_$&$\emptyset$&$\emptyset$&\\\hline
$3$&$1\ldots b\un{a}$&$2\ldots db\_$&$\emptyset$&$\emptyset$&\\\hline
$4$&$1\ldots e\un{a}$&$1\ldots ba\_$&$\emptyset$&$\emptyset$&\\\hline
$5$&$1\ldots e\un{a}$&$2\ldots db\_$&$\emptyset$&$\emptyset$&\\\hline
$6$&$1\ldots a\un{b}$&$2\ldots ec$&$\emptyset$&$\emptyset$\\\hline
$7$&$1\ldots a\un{b}$&$1\ldots ba\_$&$\emptyset$&$\emptyset$&\\\hline
$8$&$1\ldots a\un{b}$&$2\ldots db\_$&$\emptyset$&$\emptyset$&\\\hline
$9$&$1\ldots d\un{b}$&$1\ldots ba\_$&$\alpha$&$2\ldots\un{c}b\alpha$&$RHS$\\\hline
$10$&$1\ldots d\un{b}$&$1\ldots bd\_$&$\alpha$&$2\ldots\un{c}b\alpha$&$RHS$\\\hline
$11$&$1\ldots d\un{b}$&$2\ldots cb\_$&$\alpha$&$2\ldots\un{c}b\alpha$&$RHS$\\\hline
$12$&$1\ldots d\un{b}$&$2\ldots db\_$&$\alpha$&$2\ldots\un{c}b\alpha$&$RHS$\\\hline
$13$&$1\ldots b\un{c}$&$1\ldots bc\_$&$\emptyset$&$\emptyset$&\\\hline
$14$&$1\ldots b\un{c}$&$2\ldots ab\_$&$\emptyset$&$\emptyset$&\\\hline
$15$&$1\ldots b\un{c}$&$4\ldots ac\_$&$\emptyset$&$\emptyset$&\\\hline
$16$&$1\ldots b\un{c}$&$4\ldots cc\_$&$\emptyset$&$\emptyset$&\\\hline
$17$&$1\ldots c\un{c}$&$1\ldots bc\_$&$\alpha$&$2\ldots\un{a}c\alpha$&$RHS$\\\hline
$18$&$1\ldots c\un{c}$&$2\ldots db\_$&$\alpha$&$2\ldots\un{a}c\alpha$&$RHS$\\\hline
$19$&$1\ldots c\un{c}$&$3\ldots bc\_$&$\alpha$&$2\ldots\un{a}c\alpha$&$RHS$\\\hline
$20$&$1\ldots d\un{c}$&$1\ldots bc\_$&$\alpha$&$2\ldots\un{c}c\alpha$&$RHS$\\\hline
$21$&$1\ldots d\un{c}$&$2\ldots ab\_$&$\alpha$&$2\ldots\un{c}c\alpha$&$RHS$\\\hline
$22$&$1\ldots d\un{c}$&$2\ldots db\_$&$\alpha$&$2\ldots\un{c}c\alpha$&$RHS$\\\hline
$23$&$1\ldots d\un{c}$&$3\ldots bc\_$&$\alpha$&$2\ldots\un{c}c\alpha$&$RHS$\\\hline
$24$&$1\ldots d\un{c}$&$4\ldots ac\_$&$\alpha$&$2\ldots\un{c}c\alpha$&$RHS$\\\hline
$25$&$1\ldots d\un{c}$&$4\ldots cc\_$&$\alpha$&$2\ldots\un{c}c\alpha$&$RHS$\\\hline
$26$&$2\ldots a\un{b}$&$1\ldots bd\_$&$a$&$3\ldots b\un{c}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots b\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots b\un{a}$&$2\ldots db\_$\\\hline
$27$&$2\ldots a\un{b}$&$2\ldots ab\_$&$a$&$3\ldots b\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots b\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots b\un{a}$&$3\ldots cc$\\\hline
$28$&$2\ldots a\un{b}$&$3\ldots bc\_$&$a$&$3\ldots b\un{c}$&$4\ldots cc\_$\\
&&&$d$&$1\ldots b\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots b\un{a}$&$3\ldots cb\_$\\\hline
$29$&$2\ldots d\un{b}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$30$&$2\ldots d\un{b}$&$4\ldots aa$&$\emptyset$&$\emptyset$\\\hline
$31$&$2\ldots d\un{b}$&$1\ldots bd\_$&$a$&$3\ldots b\un{c}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots b\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots b\un{a}$&$2\ldots db\_$\\\hline
$32$&$2\ldots d\un{b}$&$2\ldots ab\_$&$a$&$3\ldots b\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots b\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots b\un{a}$&$3\ldots cc$\\\hline
$33$&$2\ldots d\un{b}$&$2\ldots db\_$&$a$&$3\ldots b\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots b\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots b\un{a}$&$5\ldots cc$\\\hline
$34$&$2\ldots d\un{b}$&$3\ldots cc\_$&$a$&$3\ldots b\un{c}$&$4\ldots cc\_$\\
&&&$d$&$1\ldots b\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots b\un{a}$&$3\ldots cb\_$\\\hline
$35$&$2\ldots b\un{e}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$36$&$2\ldots b\un{e}$&$1\ldots bd\_$&$a$&$3\ldots e\un{c}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots e\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots e\un{a}$&$2\ldots db\_$\\
&&&$\alpha$&$1\ldots\un{d}e\alpha$&$RHS$\\
&&&$\alpha$&$1\ldots\un{e}e\alpha$&$RHS$\\\hline
$37$&$2\ldots b\un{e}$&$2\ldots ab\_$&$a$&$3\ldots e\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots e\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots e\un{a}$&$3\ldots cc$\\
&&&$\alpha$&$1\ldots\un{d}e\alpha$&$RHS$\\
&&&$\alpha$&$1\ldots\un{e}e\alpha$&$RHS$\\\hline
$38$&$2\ldots b\un{e}$&$2\ldots db\_$&$a$&$3\ldots e\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots e\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots e\un{a}$&$5\ldots cc$\\
&&&$\alpha$&$1\ldots\un{d}e\alpha$&$RHS$\\
&&&$\alpha$&$1\ldots\un{e}e\alpha$&$RHS$\\\hline
$39$&$2\ldots c\un{e}$&$4\ldots aa$&$\emptyset$&$\emptyset$\\\hline
$40$&$2\ldots c\un{e}$&$1\ldots bd\_$&$a$&$3\ldots e\un{c}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots e\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots e\un{a}$&$2\ldots db\_$\\\hline
$41$&$2\ldots c\un{e}$&$3\ldots cc\_$&$a$&$3\ldots e\un{c}$&$4\ldots cc\_$\\
&&&$d$&$1\ldots e\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots e\un{a}$&$3\ldots cb\_$\\\hline
$42$&$2\ldots d\un{e}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$43$&$2\ldots d\un{e}$&$4\ldots aa$&$\emptyset$&$\emptyset$\\\hline
$44$&$2\ldots d\un{e}$&$1\ldots bd\_$&$a$&$3\ldots e\un{c}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots e\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots e\un{a}$&$2\ldots db\_$\\\hline
$45$&$2\ldots d\un{e}$&$2\ldots ab\_$&$a$&$3\ldots e\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots e\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots e\un{a}$&$3\ldots cc$\\\hline
$46$&$2\ldots d\un{e}$&$2\ldots db\_$&$a$&$3\ldots e\un{c}$&$1\ldots bc\_$\\
&&&$d$&$1\ldots e\un{a}$&$1\ldots ba\_$\\
&&&$e$&$5\ldots e\un{a}$&$5\ldots cc$\\\hline
$47$&$2\ldots d\un{e}$&$3\ldots cc\_$&$a$&$3\ldots e\un{c}$&$4\ldots cc\_$\\
&&&$d$&$1\ldots e\un{a}$&$2\ldots db\_$\\
&&&$e$&$5\ldots e\un{a}$&$3\ldots cb\_$\\\hline
$48$&$3\ldots a\un{b}$&$1\ldots bd\_$&$a$&$1\ldots b\un{c}$&$2\ldots ab\_$\\
&&&$b$&$4\ldots b\un{a}$&$3\ldots cd$\\
&&&$c$&$2\ldots b\un{e}$&$3\ldots ca$\\
&&&$e$&$5\ldots b\un{b}$&$2\ldots db\_$\\
&&&$\alpha$&$5\ldots \un{c}b\alpha$&$RHS$\\
&&&$\alpha$&$5\ldots \un{e}b\alpha$&$RHS$\\\hline
$49$&$3\ldots a\un{b}$&$2\ldots ab\_$&$a$&$1\ldots b\un{c}$&$1\ldots bc\_$\\
&&&$b$&$4\ldots b\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots b\un{e}$&$1\ldots bd\_$\\
&&&$e$&$5\ldots b\un{b}$&$3\ldots cc$\\
&&&$\alpha$&$5\ldots \un{c}b\alpha$&$RHS$\\
&&&$\alpha$&$5\ldots \un{e}b\alpha$&$RHS$\\\hline
$50$&$3\ldots a\un{b}$&$3\ldots bc\_$&$a$&$1\ldots b\un{c}$&$4\ldots cc\_$\\
&&&$b$&$4\ldots b\un{a}$&$2\ldots ab\_$\\
&&&$c$&$2\ldots b\un{e}$&$3\ldots cb\_$\\
&&&$e$&$5\ldots b\un{b}$&$RHS$\\
&&&$\alpha$&$5\ldots \un{c}b\alpha$&$RHS$\\
&&&$\alpha$&$5\ldots \un{e}b\alpha$&$RHS$\\\hline
$51$&$3\ldots d\un{b}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$52$&$3\ldots d\un{b}$&$4\ldots aa$&$\emptyset$&$\emptyset$\\\hline
$53$&$3\ldots d\un{b}$&$1\ldots bd\_$&$a$&$1\ldots b\un{c}$&$2\ldots ab\_$\\
&&&$b$&$4\ldots b\un{a}$&$3\ldots cd$\\
&&&$c$&$2\ldots b\un{e}$&$3\ldots ca$\\
&&&$e$&$5\ldots b\un{b}$&$2\ldots db\_$\\\hline
$54$&$3\ldots d\un{b}$&$2\ldots ab\_$&$a$&$1\ldots b\un{c}$&$1\ldots bc\_$\\
&&&$b$&$4\ldots b\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots b\un{e}$&$1\ldots bd\_$\\
&&&$e$&$5\ldots b\un{b}$&$3\ldots cc$\\\hline
$55$&$3\ldots d\un{b}$&$2\ldots db\_$&$a$&$1\ldots b\un{c}$&$1\ldots bc\_$\\
&&&$b$&$4\ldots b\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots b\un{e}$&$1\ldots bd\_$\\
&&&$e$&$5\ldots b\un{b}$&$5\ldots cc$\\\hline
$56$&$3\ldots d\un{b}$&$3\ldots cc\_$&$a$&$1\ldots b\un{c}$&$4\ldots cc\_$\\
&&&$b$&$4\ldots b\un{a}$&$2\ldots ab\_$\\
&&&$c$&$2\ldots b\un{e}$&$2\ldots ab\_$\\
&&&$e$&$5\ldots b\un{b}$&$3\ldots cb\_$\\\hline
$57$&$3\ldots b\un{c}$&$1\ldots bc\_$&$a$&$1\ldots c\un{c}$&$2\ldots db\_$\\
&&&$b$&$4\ldots c\un{a}$&$2\ldots db\_$\\
&&&$c$&$2\ldots c\un{e}$&$4\ldots aa$\\
&&&$e$&$5\ldots c\un{b}$&$2\ldots cb\_$\\
&&&$\alpha$&$3\ldots \un{e}c\alpha$&$RHS$\\
\hline
$58$&$3\ldots b\un{c}$&$2\ldots ab\_$&$a$&$1\ldots c\un{c}$&$1\ldots bc\_$\\
&&&$b$&$4\ldots c\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots c\un{e}$&$1\ldots bd\_$\\
&&&$e$&$5\ldots c\un{b}$&$3\ldots cc$\\
&&&$\alpha$&$3\ldots \un{e}c\alpha$&$RHS$\\\hline
$59$&$3\ldots b\un{c}$&$4\ldots ac\_$&$a$&$1\ldots c\un{c}$&$3\ldots bc\_$\\
&&&$b$&$4\ldots c\un{a}$&$4\ldots cb\_$\\
&&&$c$&$2\ldots c\un{e}$&$3\ldots cc\_$\\
&&&$e$&$5\ldots c\un{b}$&$5\ldots ca\_$\\
&&&$\alpha$&$3\ldots \un{e}c\alpha$&$RHS$\\\hline
$60$&$3\ldots b\un{c}$&$4\ldots cc\_$&$a$&$1\ldots c\un{c}$&$3\ldots bc\_$\\
&&&$b$&$4\ldots c\un{a}$&$4\ldots cb\_$\\
&&&$c$&$2\ldots c\un{e}$&$3\ldots cc\_$\\
&&&$e$&$5\ldots c\un{b}$&$5\ldots ca\_$\\
&&&$\alpha$&$3\ldots \un{e}c\alpha$&$RHS$\\\hline
$61$&$3\ldots e\un{c}$&$1\ldots bc\_$&$a$&$1\ldots c\un{c}$&$2\ldots db\_$\\
&&&$b$&$4\ldots c\un{a}$&$2\ldots db\_$\\
&&&$c$&$2\ldots c\un{e}$&$4\ldots aa$\\
&&&$e$&$5\ldots c\un{b}$&$2\ldots cb\_$\\\hline
$62$&$3\ldots e\un{c}$&$2\ldots ab\_$&$a$&$1\ldots c\un{c}$&$1\ldots bc\_$\\
&&&$b$&$4\ldots c\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots c\un{e}$&$1\ldots bd\_$\\
&&&$e$&$5\ldots c\un{b}$&$3\ldots cc$\\\hline
$63$&$3\ldots e\un{c}$&$4\ldots cc\_$&$a$&$1\ldots c\un{c}$&$3\ldots bc\_$\\
&&&$b$&$4\ldots c\un{a}$&$4\ldots cb\_$\\
&&&$c$&$2\ldots c\un{e}$&$3\ldots cc\_$\\
&&&$e$&$5\ldots c\un{b}$&$5\ldots ca\_$\\\hline
$64$&$3\ldots a\un{d}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$65$&$3\ldots a\un{d}$&$1\ldots bc\_$&$a$&$1\ldots d\un{c}$&$2\ldots db\_$\\
&&&$b$&$4\ldots d\un{a}$&$2\ldots db\_$\\
&&&$c$&$2\ldots d\un{e}$&$4\ldots aa$\\
&&&$e$&$5\ldots d\un{b}$&$2\dots cb\_$\\
&&&$\alpha$&$5\ldots \un{c}d\alpha$&$RHS$\\
&&&$\alpha$&$5\ldots \un{e}d\alpha$&$RHS$\\
\hline
$66$&$3\ldots a\un{d}$&$1\ldots bd\_$&$a$&$1\ldots d\un{c}$&$2\ldots ab\_$\\
&&&$b$&$4\ldots d\un{a}$&$3\ldots cd$\\
&&&$c$&$2\ldots d\un{e}$&$3\ldots ca$\\
&&&$e$&$5\ldots d\un{b}$&$2\dots db\_$\\
&&&$\alpha$&$5\ldots \un{c}d\alpha$&$RHS$\\
&&&$\alpha$&$5\ldots \un{e}d\alpha$&$RHS$\\\hline
$67$&$3\ldots b\un{d}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$68$&$3\ldots b\un{d}$&$1\ldots bc\_$&$a$&$1\ldots d\un{c}$&$2\ldots db\_$\\
&&&$b$&$4\ldots d\un{a}$&$2\ldots db\_$\\
&&&$c$&$2\ldots d\un{e}$&$4\ldots aa$\\
&&&$e$&$5\ldots d\un{b}$&$2\ldots cb\_$\\
&&&$\alpha$&$3\ldots \un{e}d\alpha$&$RHS$\\
\hline
$69$&$3\ldots b\un{d}$&$1\ldots bd\_$&$a$&$1\ldots d\un{c}$&$2\ldots ab\_$\\
&&&$b$&$4\ldots d\un{a}$&$3\ldots cd$\\
&&&$c$&$2\ldots d\un{e}$&$3\ldots ca$\\
&&&$e$&$5\ldots d\un{b}$&$2\ldots db\_$\\
&&&$\alpha$&$3\ldots \un{e}d\alpha$&$RHS$\\\hline
$70$&$3\ldots b\un{d}$&$3\ldots aa\_$&$a$&$1\ldots d\un{c}$&$4\ldots ac\_$\\
&&&$b$&$4\ldots d\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots d\un{e}$&$2\ldots db\_$\\
&&&$e$&$5\ldots d\un{b}$&$3\ldots ab\_$\\
&&&$\alpha$&$3\ldots \un{e}d\alpha$&$RHS$\\\hline
$71$&$3\ldots b\un{d}$&$4\ldots cc\_$&$a$&$1\ldots d\un{c}$&$3\ldots bc\_$\\
&&&$b$&$4\ldots d\un{a}$&$4\ldots cb\_$\\
&&&$c$&$2\ldots d\un{e}$&$3\ldots cc\_$\\
&&&$e$&$5\ldots d\un{b}$&$5\ldots ca\_$\\
&&&$\alpha$&$3\ldots \un{e}d\alpha$&$RHS$\\
\hline
$72$&$3\ldots d\un{d}$&$4\ldots aa$&$\emptyset$&$\emptyset$\\\hline
$73$&$3\ldots d\un{d}$&$1\ldots bd\_$&$a$&$1\ldots d\un{c}$&$2\ldots ab\_$\\
&&&$b$&$4\ldots d\un{a}$&$3\ldots cd$\\
&&&$c$&$2\ldots d\un{e}$&$3\ldots ca$\\
&&&$e$&$5\ldots d\un{b}$&$2\ldots db\_$\\\hline

$74$&$3\ldots d\un{d}$&$2\ldots ab\_$&$a$&$1\ldots d\un{c}$&$1\ldots bc\_$\\
&&&$b$&$4\ldots d\un{a}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots d\un{e}$&$1\ldots bd\_$\\
&&&$e$&$5\ldots d\un{b}$&$3\ldots cc$\\\hline
$75$&$3\ldots d\un{d}$&$3\ldots cc\_$&$a$&$1\ldots d\un{c}$&$4\ldots cc\_$\\
&&&$b$&$4\ldots d\un{a}$&$2\ldots ab\_$\\
&&&$c$&$2\ldots d\un{e}$&$2\ldots ab\_$\\
&&&$e$&$5\ldots d\un{b}$&$3\ldots cb\_$\\\hline
$76$&$4\ldots b\un{a}$&$3\ldots cd$&$\emptyset$&$\emptyset$\\\hline
$77$&$4\ldots b\un{a}$&$2\ldots ab\_$&$a$&$5\ldots a\un{d}$&$1\ldots bc\_$\\
&&&$c$&$2\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$c$&$3\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$d$&$1\ldots a\un{b}$&$1\ldots ba\_$\\
&&&$\alpha$&$4\ldots\un{b}a\alpha$&$RHS$\\
\hline
$78$&$4\ldots b\un{a}$&$3\ldots bc\_$&$a$&$5\ldots a\un{d}$&$4\ldots cc\_$\\
&&&$c$&$2\ldots a\un{b}$&$2\ldots ab\_$\\
&&&$c$&$3\ldots a\un{b}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots a\un{b}$&$2\ldots db\_$\\
&&&$\alpha$&$4\ldots \un{b}a\alpha$&$RHS$\\\hline
$79$&$4\ldots c\un{a}$&$2\ldots db\_$&$a$&$5\ldots a\un{d}$&$1\ldots bc\_$\\
&&&$c$&$2\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$c$&$3\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$d$&$1\ldots a\un{b}$&$1\ldots ba\_$\\
&&&$\alpha$&$3\ldots\un{a}a\alpha$&$RHS$\\
\hline
$80$&$4\ldots c\un{a}$&$3\ldots bc\_$&$a$&$5\ldots a\un{d}$&$4\ldots cc\_$\\
&&&$c$&$2\ldots a\un{b}$&$2\ldots ab\_$\\
&&&$c$&$3\ldots a\un{b}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots a\un{b}$&$2\ldots db\_$\\
&&&$\alpha$&$3\ldots\un{a}a\alpha$&$RHS$\\\hline
$81$&$4\ldots c\un{a}$&$4\ldots cb\_$&$a$&$5\ldots a\un{d}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots a\un{b}$&$3\ldots bc\_$\\
&&&$c$&$3\ldots a\un{b}$&$3\ldots bc\_$\\
&&&$d$&$1\ldots a\un{b}$&$2\ldots ec$\\
&&&$\alpha$&$3\ldots\un{a}a\alpha$&$RHS$\\\hline
$82$&$4\ldots d\un{a}$&$3\ldots cd$&$\emptyset$&$\emptyset$\\\hline
$83$&$4\ldots d\un{a}$&$2\ldots ab\_$&$a$&$5\ldots a\un{d}$&$1\ldots bc\_$\\
&&&$c$&$2\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$c$&$3\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$d$&$1\ldots a\un{b}$&$1\ldots ba\_$\\\hline
$84$&$4\ldots d\un{a}$&$2\ldots db\_$&$a$&$5\ldots a\un{d}$&$1\ldots bc\_$\\
&&&$c$&$2\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$c$&$3\ldots a\un{b}$&$1\ldots bd\_$\\
&&&$d$&$1\ldots a\un{b}$&$1\ldots ba\_$\\\hline
$85$&$4\ldots d\un{a}$&$3\ldots bc\_$&$a$&$5\ldots a\un{d}$&$4\ldots cc\_$\\
&&&$c$&$2\ldots a\un{b}$&$2\ldots ab\_$\\
&&&$c$&$3\ldots a\un{b}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots a\un{b}$&$2\ldots db\_$\\\hline
$86$&$4\ldots d\un{a}$&$4\ldots cb\_$&$a$&$5\ldots a\un{d}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots a\un{b}$&$3\ldots bc\_$\\
&&&$c$&$3\ldots a\un{b}$&$3\ldots bc\_$\\
&&&$d$&$1\ldots a\un{b}$&$2\ldots ec$\\\hline
$87$&$4\ldots a\un{d}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$88$&$4\ldots a\un{d}$&$1\ldots bc\_$&$a$&$5\ldots d\un{d}$&$2\ldots db\_$\\
&&&$c$&$2\ldots d\un{b}$&$4\ldots aa$\\
&&&$c$&$3\ldots d\un{b}$&$4\ldots aa$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots cb\_$\\\hline
$89$&$4\ldots a\un{d}$&$1\ldots bd\_$&$a$&$5\ldots d\un{d}$&$2\ldots ab\_$\\
&&&$c$&$2\ldots d\un{b}$&$3\ldots ca$\\
&&&$c$&$3\ldots d\un{b}$&$3\ldots ca$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots db\_$\\\hline
$90$&$4\ldots b\un{d}$&$3\ldots ca$&$\emptyset$&$\emptyset$\\\hline
$91$&$4\ldots b\un{d}$&$1\ldots bc\_$&$a$&$5\ldots d\un{d}$&$2\ldots db\_$\\
&&&$c$&$2\ldots d\un{b}$&$4\ldots aa$\\
&&&$c$&$3\ldots d\un{b}$&$4\ldots aa$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots cb\_$\\
&&&$\alpha$&$4\ldots\un{b}d\alpha$&$RHS$\\
\hline
$92$&$4\ldots b\un{d}$&$1\ldots bd\_$&$a$&$5\ldots d\un{d}$&$2\ldots ab\_$\\
&&&$c$&$2\ldots d\un{b}$&$3\ldots ca$\\
&&&$c$&$3\ldots d\un{b}$&$3\ldots ca$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots db\_$\\
&&&$\alpha$&$4\ldots\un{b}d\alpha$&$RHS$\\
\hline
$93$&$4\ldots b\un{d}$&$3\ldots aa\_$&$a$&$5\ldots d\un{d}$&$4\ldots ac\_$\\
&&&$c$&$2\ldots d\un{b}$&$2\ldots db\_$\\
&&&$c$&$3\ldots d\un{b}$&$2\ldots db\_$\\
&&&$d$&$1\ldots d\un{b}$&$1\ldots bd\_$\\
&&&$\alpha$&$4\ldots\un{b}d\alpha$&$RHS$\\
\hline
$94$&$4\ldots b\un{d}$&$4\ldots cc\_$&$a$&$5\ldots d\un{d}$&$3\ldots bc\_$\\
&&&$c$&$2\ldots d\un{b}$&$3\ldots cc\_$\\
&&&$c$&$3\ldots d\un{b}$&$3\ldots cc\_$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots db\_$\\
&&&$\alpha$&$4\ldots\un{b}d\alpha$&$RHS$\\\hline
$95$&$4\ldots d\un{d}$&$4\ldots aa$&$\emptyset$&$\emptyset$\\\hline
$96$&$4\ldots d\un{d}$&$1\ldots bd\_$&$a$&$5\ldots d\un{d}$&$2\ldots ab\_$\\
&&&$c$&$2\ldots d\un{b}$&$3\ldots ca$\\
&&&$c$&$3\ldots d\un{b}$&$3\ldots ca$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots db\_$\\\hline
$97$&$4\ldots d\un{d}$&$2\ldots ab\_$&$a$&$5\ldots d\un{d}$&$1\ldots bc\_$\\
&&&$c$&$2\ldots d\un{b}$&$1\ldots bd\_$\\
&&&$c$&$3\ldots d\un{b}$&$1\ldots bd\_$\\
&&&$d$&$1\ldots d\un{b}$&$1\ldots ba\_$\\\hline
$98$&$4\ldots d\un{d}$&$3\ldots cc\_$&$a$&$5\ldots d\un{d}$&$4\ldots cc\_$\\
&&&$c$&$2\ldots d\un{b}$&$2\ldots ab\_$\\
&&&$c$&$3\ldots d\un{b}$&$2\ldots ab\_$\\
&&&$d$&$1\ldots d\un{b}$&$2\ldots db\_$\\\hline
$99$&$5\ldots b\un{a}$&$3\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$100$&$5\ldots b\un{a}$&$5\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$101$&$5\ldots b\un{a}$&$2\ldots db\_$&$c$&$3\ldots a\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots a\un{d}$&$1\ldots bd\_$\\\hline
$102$&$5\ldots b\un{a}$&$3\ldots ab\_$&$c$&$3\ldots a\un{d}$&$3\ldots ca$\\
&&&$c$&$4\ldots a\un{d}$&$3\ldots ca$\\\hline
$103$&$5\ldots b\un{a}$&$3\ldots cb\_$&$c$&$3\ldots a\un{d}$&$1\ldots bc\_$\\
&&&$c$&$4\ldots a\un{d}$&$1\ldots bc\_$\\\hline
$104$&$5\ldots e\un{a}$&$3\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$105$&$5\ldots e\un{a}$&$5\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$106$&$5\ldots e\un{a}$&$2\ldots db\_$&$c$&$3\ldots a\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots a\un{d}$&$1\ldots bd\_$\\\hline
$107$&$5\ldots e\un{a}$&$3\ldots cb\_$&$c$&$3\ldots a\un{d}$&$1\ldots bc\_$\\
&&&$c$&$4\ldots a\un{d}$&$1\ldots bc\_$\\\hline
$108$&$5\ldots b\un{b}$&$3\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$109$&$5\ldots b\un{b}$&$5\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$110$&$5\ldots b\un{b}$&$2\ldots db\_$&$c$&$3\ldots b\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots b\un{d}$&$1\ldots bd\_$\\\hline
$111$&$5\ldots b\un{b}$&$3\ldots ab\_$&$c$&$3\ldots b\un{d}$&$3\ldots ca$\\
&&&$c$&$4\ldots b\un{d}$&$3\ldots ca$\\\hline
$112$&$5\ldots b\un{b}$&$3\ldots cb\_$&$c$&$3\ldots b\un{d}$&$1\ldots bc\_$\\
&&&$c$&$4\ldots b\un{d}$&$1\ldots bc\_$\\\hline
$113$&$5\ldots c\un{b}$&$3\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$114$&$5\ldots c\un{b}$&$5\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$115$&$5\ldots c\un{b}$&$1\ldots bd\_$&$c$&$3\ldots b\un{d}$&$3\ldots ca$\\
&&&$c$&$4\ldots b\un{d}$&$3\ldots ca$\\\hline
$116$&$5\ldots c\un{b}$&$2\ldots cb\_$&$c$&$3\ldots b\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots b\un{d}$&$1\ldots bd\_$\\\hline
$117$&$5\ldots c\un{b}$&$5\ldots ca\_$&$c$&$3\ldots b\un{d}$&$3\ldots aa\_$\\
&&&$c$&$4\ldots b\un{d}$&$3\ldots aa\_$\\\hline
$118$&$5\ldots d\un{b}$&$3\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$119$&$5\ldots d\un{b}$&$5\ldots cc$&$\emptyset$&$\emptyset$\\\hline
$120$&$5\ldots d\un{b}$&$2\ldots cb\_$&$c$&$3\ldots b\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots b\un{d}$&$1\ldots bd\_$\\\hline
$121$&$5\ldots d\un{b}$&$2\ldots db\_$&$c$&$3\ldots b\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots b\un{d}$&$1\ldots bd\_$\\\hline
$122$&$5\ldots d\un{b}$&$3\ldots ab\_$&$c$&$3\ldots b\un{d}$&$3\ldots ca$\\
&&&$c$&$4\ldots b\un{d}$&$3\ldots ca$\\\hline
$123$&$5\ldots d\un{b}$&$3\ldots cb\_$&$c$&$3\ldots b\un{d}$&$1\ldots bc\_$\\
&&&$c$&$4\ldots b\un{d}$&$1\ldots bc\_$\\\hline
$124$&$5\ldots d\un{b}$&$5\ldots ca\_$&$c$&$3\ldots b\un{d}$&$3\ldots aa\_$\\
&&&$c$&$4\ldots b\un{d}$&$3\ldots aa\_$\\\hline
$125$&$5\ldots a\un{d}$&$1\ldots bc\_$&$c$&$3\ldots d\un{d}$&$4\ldots aa$\\
&&&$c$&$4\ldots d\un{d}$&$4\ldots aa$\\
&&&$\alpha$&$4\ldots \un{e}d\alpha$&$RHS$\\
\hline
$126$&$5\ldots a\un{d}$&$3\ldots bc\_$&$c$&$3\ldots d\un{d}$&$2\ldots ab\_$\\
&&&$c$&$4\ldots d\un{d}$&$2\ldots ab\_$\\
&&&$\alpha$&$4\ldots \un{e}d\alpha$&$RHS$\\\hline
$127$&$5\ldots a\un{d}$&$4\ldots cc\_$&$c$&$3\ldots d\un{d}$&$3\ldots cc\_$\\
&&&$c$&$4\ldots d\un{d}$&$3\ldots cc\_$\\
&&&$\alpha$&$4\ldots \un{e}d\alpha$&$RHS$\\\hline
$128$&$5\ldots d\un{d}$&$1\ldots bc\_$&$c$&$3\ldots d\un{d}$&$4\ldots aa$\\
&&&$c$&$4\ldots d\un{d}$&$4\ldots aa$\\\hline
$129$&$5\ldots d\un{d}$&$2\ldots ab\_$&$c$&$3\ldots d\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots d\un{d}$&$1\ldots bd\_$\\\hline
$130$&$5\ldots d\un{d}$&$2\ldots db\_$&$c$&$3\ldots d\un{d}$&$1\ldots bd\_$\\
&&&$c$&$4\ldots d\un{d}$&$1\ldots bd\_$\\\hline
$131$&$5\ldots d\un{d}$&$3\ldots bc\_$&$c$&$3\ldots d\un{d}$&$2\ldots ab\_$\\
&&&$c$&$4\ldots d\un{d}$&$2\ldots ab\_$\\\hline
$132$&$5\ldots d\un{d}$&$4\ldots ac\_$&$c$&$3\ldots d\un{d}$&$3\ldots cc\_$\\
&&&$c$&$4\ldots d\un{d}$&$3\ldots cc\_$\\\hline
$133$&$5\ldots d\un{d}$&$4\ldots cc\_$&$c$&$3\ldots d\un{d}$&$3\ldots cc\_$\\
&&&$c$&$4\ldots d\un{d}$&$3\ldots cc\_$\\\hline
\end{longtable}
\fontsize{12}{14}\selectfont


In the same way that Table~\ref{irr_sets_l} was constructed from Table~\ref{irr_2r}, the following table was constructed from Table~\ref{irr_2r.2} using an iterative process. The set of LHS states was obtained by a similar iterative argument by ensuring that any set in column 2 with LHS state x implies that state x is also associated with the same set when it appears in column 1. The result was obtained after this iteration has converged i.e. no change was obtained after one cycle.
\pagebreak
\begin{longtable}{lll}
\caption{Relations between sets of IRR outlines of types LL and LR under F\label{irr_sets_r}}\\
Original set &Set of sets of &Set of LHS states\\
of IRR outlines&IRR outlines derived by F&\\
$\{1\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{1,4\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{2\}$&$\emptyset$&$\{4\}$\\
$\{3\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{3,5\}$&$\emptyset$&$\{3,4,5\}$\\
$\{4\}$&$\emptyset$&$\{3,4\}$\\
$\{5\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{6\}$&$\emptyset$&$\{3,4\}$\\
$\{7\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{8\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{9\}$&$\emptyset$&$\{3,4,5\}$\\
$\{10\}$&$\emptyset$&$\{3,4\}$\\
$\{11\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{12\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{13,57\}$&$\{18\},\{79\},\{39\},\{116\}$&$\{2,3,4,5\}$\\
$\{13,57,61\}$&$\{18\},\{79\},\{39\},\{116\}$&$\{2,3,4,5\}$\\
$\{14,58,62\}$&$\{17\},\{80\},\{40\},\{113\}$&$\{3,4,5\}$\\
$\{14,58\}$&$\{17\},\{80\},\{40\},\{113\}$&$\{2,3,4,5\}$\\
$\{15,59\}$&$\{19\},\{81\},\{41\},\{117\}$&$\{4\}$\\
$\{16,60\}$&$\{19\},\{81\},\{41\},\{117\}$&$\{3,4\}$\\
$\{16,60,63\}$&$\{19\},\{81\},\{41\},\{117\}$&$\{3\}$\\
$\{17\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{18\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{19\}$&$\emptyset$&$\{3,4\}$\\
$\{20,128\}$&$\{72,95\}$&$\{3,4,5\}$\\
$\{21,129\}$&$\{73,96\}$&$\{2,3,4,5\}$\\
$\{22,130\}$&$\{73,96\}$&$\{2,3,4,5\}$\\
$\{23,131\}$&$\{74,97\}$&$\{3\}$\\
$\{24,132\}$&$\{75,98\}$&$\{3,4\}$\\
$\{25,133\}$&$\{75,98\}$&$\{2,3,4,5\}$\\
$\{26,48\}$&$\{14,58\},\{76\},\{35\},\{3\},\{101,110\}$&$\{2,3,4,5\}$\\
$\{27,49\}$&$\{13,57\},\{78\},\{36\},\{1\},\{99,108\}$&$\{2,3,4,5\}$\\
$\{28,50\}$&$\{16,60\},\{77\},\{37\},\{3\},\{103,112\}$&$\{3,4\}$\\
$\{29,42,51\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{30,43,52\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{31,44,53\}$&$\{14,58,62\},\{76\},\{35\},\{3,5\},\{101,106,110\}$&$\{3,4,5\}$\\
$\{32,45,54\}$&$\{13,57,61\},\{78\},\{36\},\{1,4\},\{99,104,108\}$&$\{2,3,4,5\}$\\
$\{33,46,55\}$&$\{13,57,61\},\{78\},\{36\},\{1,4\},\{100,105,109\}$&$\{3,4\}$\\
$\{34,47,56\}$&$\{16,60,63\},\{77\},\{37\},\{3,5\},\{103,107,112\}$&$\{3\}$\\
$\{35\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{36\}$&$\{62\},\{5\},\{106\}$&$\{2,3,4,5\}$\\
$\{37\}$&$\{61\},\{4\},\{104\}$&$\{3,4\}$\\
$\{38\}$&$\{61\},\{4\},\{105\}$&$\{4\}$\\
$\{39\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{40\}$&$\{62\},\{5\},\{106\}$&$\{2,3,4,5\}$\\
$\{41\}$&$\{63\},\{5\},\{107\}$&$\{3,4\}$\\
$\{61\}$&$\{18\},\{79\},\{39\},\{116\}$&$\{3,4\}$\\
$\{62\}$&$\{17\},\{80\},\{40\},\{113\}$&$\{2,3,4,5\}$\\
$\{63\}$&$\{19\},\{81\},\{41\},\{117\}$&$\{3,4\}$\\
$\{64,67,87,90\}$&$\emptyset$&$\{4\}$\\
$\{65,88\}$&$\{22,130\},\{84\},\{30,43,52\},\{11\},\{120\}$&$\{3,4\}$\\
$\{65,68,88,91\}$&$\{22,130\},\{84\},\{30,43,52\},\{11\},\{120\}$&$\{3,4\}$\\
$\{66,89\}$&$\{21,129\},\{82\},\{29,42,51\},\{12\},\{121\}$&$\{2,3,4,5\}$\\
$\{66,69,89,92\}$&$\{21,129\},\{82\},\{29,42,51\},\{12\},\{121\}$&$\{2,3,4,5\}$\\
$\{67,90\}$&$\emptyset$&$\{2,3,4\}$\\
$\{68,91\}$&$\{22,130\},\{84\},\{30,43,52\},\{11\},\{120\}$&$\{2,3,4,5\}$\\
$\{69,92\}$&$\{21,129\},\{82\},\{29,42,51\},\{12\},\{121\}$&$\{2,3,4,5\}$\\
$\{70,93\}$&$\{24,132\},\{85\},\{33,46,55\},\{10\},\{122\}$&$\{3,4\}$\\
$\{71,94\}$&$\{23,131\},\{86\},\{34,47,56\},\{12\},\{124\}$&$\{3\}$\\
$\{72,95\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{73,96\}$&$\{21,129\},\{82\},\{29,42,51\},\{12\},\{121\}$&$\{2,3,4,5\}$\\
$\{74,97\}$&$\{20,128\},\{85\},\{31,44,53\},\{9\},\{118\}$&$\{3,4\}$\\
$\{75,98\}$&$\{25,133\},\{83\},\{32,45,54\},\{12\},\{123\}$&$\{2,3,4,5\}$\\
$\{76\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{77\}$&$\{125\},\{26,48\},\{7\}$&$\{3,4\}$\\
$\{78\}$&$\{127\},\{27,49\},\{8\}$&$\{2,3,4,5\}$\\
$\{79\}$&$\{125\},\{26,48\},\{7\}$&$\{2,3,4,5\}$\\
$\{80\}$&$\{127\},\{27,49\},\{8\}$&$\{2,3,4,5\}$\\
$\{81\}$&$\{126\},\{28,50\},\{6\}$&$\{3,4\}$\\
$\{82\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{83\}$&$\{125\},\{26,48\},\{7\}$&$\{2,3,4,5\}$\\
$\{84\}$&$\{125\},\{26,48\},\{7\}$&$\{2,3,4,5\}$\\
$\{85\}$&$\{127\},\{27,49\},\{8\}$&$\{3,4,5\}$\\
$\{86\}$&$\{126\},\{28,50\},\{6\}$&$\{3\}$\\
$\{99,108\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{99,104,108\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{100,105,109\}$&$\emptyset$&$\{3,4\}$\\
$\{101,110\}$&$\{66,69,89,92\}$&$\{2,3,4,5\}$\\
$\{101,106,110\}$&$\{66,69,89,92\}$&$\{3,4,5\}$\\
$\{102,111\}$&$\{64,67,87,90\}$&$\{4\}$\\
$\{103,112\}$&$\{65,68,88,91\}$&$\{3,4\}$\\
$\{103,107,112\}$&$\{65,68,88,91\}$&$\{3\}$\\
$\{104\}$&$\emptyset$&$\{3,4\}$\\
$\{105\}$&$\emptyset$&$\{4\}$\\
$\{106\}$&$\{66,89\}$&$\{2,3,4,5\}$\\
$\{107\}$&$\{65,88\}$&$\{3,4\}$\\
$\{113\}$&$\emptyset$&$\{2,3,4,5\}$\\
$\{114\}$&$\emptyset$&$\{2\}$\\
$\{115\}$&$\{67,90\}$&$\{2\}$\\
$\{116\}$&$\{69,92\}$&$\{2,3,4,5\}$\\
$\{117\}$&$\{70,93\}$&$\{3,4\}$\\
$\{118\}$&$\emptyset$&$\{3,4\}$\\
$\{119\}$&$\emptyset$&$\{5\}$\\
$\{120\}$&$\{69,92\}$&$\{2,3,4,5\}$\\
$\{121\}$&$\{69,92\}$&$\{2,3,4,5\}$\\
$\{122\}$&$\{67,90\}$&$\{3,4\}$\\
$\{123\}$&$\{68,91\}$&$\{2,3,4,5\}$\\
$\{124\}$&$\{70,93\}$&$\{3\}$\\
$\{125\}$&$\{72,95\}$&$\{2,3,4,5\}$\\
$\{126\}$&$\{74,97\}$&$\{3,4\}$\\
$\{127\}$&$\{75,98\}$&$\{2,3,4,5\}$\\
\end{longtable}
From these results, Table~\ref{path_lengths_r} of all the numbers (p) of steps needed to get to and from each set (by any path) to each NSCC ($S1$,$S2$, and $S3$) were found. This table in in two parts that were for convenience put side by side, the path lengths to each NSCC and the path lengths from each NSCC. This was done to better understand the context of the NSCC's in the whole directed graph and facilitate the calculation of the frequencies of the IRR. The first step is to put in the Table~\ref{path_lengths_r} the zeros representing membership of the NSCC's. Then for the first half i.e. paths to each NSCC, $\emptyset$ was put for each set and NSCC where the set has $\emptyset$ in column 2 of Table~\ref{irr_sets_r}. Then for each half of Table~\ref{path_lengths_r} separately, an iterative process was carried out in which for each cycle, every set was considered once separately in order to update the body of the appropriate half of the table by adding additional values. Cycles of the process were repeated until there were no changes after a complete cycle. Near the end, this calculation can be speeded up by noticing which entries were changed in the last cycle, and it is only the consequences of these changes that have to be followed up in the next cycle. 
The content of Table~\ref{path_lengths_r} had to be chosen in order to ensure convergence, i.e. the eventual 
reaching a condition where there are no changes in one complete cycle. This required the avoiding of counting path lengths within any NSCC that can increase without limit. 

For the first half it is easy to show that updating can be done as follows: go to the row corresponding to a set in Table~\ref{irr_sets_r} and to the corresponding entries ($x$) in the middle column excluding those in the same SCC to find the entries in Table~\ref{path_lengths_r} for each NSCC arrived at. Add 1 to them and take the union over all the x's and union it with the already known values. If any of the these are zero (put in at stage 1), any other entry for that NSCC must be deleted leaving only the zero, because only first arrival to each NSCC is considered. As an example, consider the path lengths from $\{28,50\}$ ($\in S3$) to the NSCC's. The values are currently: -,\{2\},\{0\} for paths to $S1$,$S2$ and $S3$ respectively, where - means no information, and $\emptyset$ means there are no paths from there. The values for the sets derived from the set $\{28,50\}$, except those in $S3$, are as follows for paths to the NSCC's:
\begin{longtable}{cccc}
set&$S1$&$S2$&$S3$\\
$\{77\}$&-&\{1\}&-\\
$\{37\}$&-&-&-\\
$\{3\}$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{103,112\}$&\{3\}&\{2\}&-\\
\end{longtable}
Therefore the combined result for $\{28,50\}$ is \{4\},\{2,3\},\{0\}. Note that this is not the final result, because the results on which this one depends were updated subsequently.
During this calculation it was noted that there were more and more cases where it could be deduced that there are no possible paths from a set to an NSCC and $\emptyset$ was put in the appropriate cells. This happened when all possible paths led to $\emptyset$ as the set of paths from there to an NSCC member. 

I also constructed the second half of Table~\ref{path_lengths_r} giving the numbers of steps taken to arrive in the set starting from each NSCC. This was started in the same way, but the iterative cycle now takes each set in Table~\ref{irr_sets_r} and deduces new values (by adding 1) to be included in the set of values corresponding to each of the x's unless the original set and any of the x's are in the same NSCC in which case that x is ignored. This exception is to avoid the count going interminably round within the NSCC's. Also if one of the x's is in $S1$, $S2$ or $S3$, this is indicated by a zero, and then no other values are recorded in that cell.
For example, $\{69,92\}$ is in $S1$ and has values \{0\},\{2,3\},\{4,6\} for $S1$, $S2$ and $S3$ respectively, and the x's are $\{21,129\}$,$\{82\}$, $\{29,42,51\}$,$\{12\}$, and $\{121\}$ of which $\{21,129\}$ and $\{121\}$ are also in $S1$, so the other three have the values \{1\},\{3,4\},\{5,7\} included in their sets of values for $S1$, $S2$ and $S3$ respectively, being one more step away from the NSCC's than $\{69,92\}$ is.

After these results had converged, any cells with no information can have no path from the set to the NSCC member, so they were assigned $\emptyset$.

All the results in Table~\ref{path_lengths_r} could be extended to giving the frequencies for each of the lengths found and which sets they arrive at in the NSCC's.

Table~\ref{path_lengths_r} records the lengths of all paths from the last node in (a) the SCC containing the set or (b) each NSCC to the first node in (a) each NSCC or (b) SCC containing the set. Here a dash indicates a run of values without any omissions.
\newpage
\begin{longtable}{l|l|lll|lll}
\caption{Lengths of all paths between the SCC's and the NSCC's\label{path_lengths_r}}\\
set & NSCC & $\to S1$ & $\to S2$ & $\to S3$ & $S1\to$ & $S2\to$ & $S3\to$\\\hline
$\{1\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{5\}\\
$\{1,4\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{4\}\\
$\{2\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{3\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{1,3\}\\
$\{3,5\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{4\}\\
$\{4\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{5\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{1,5,6\}\\
$\{6\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{7\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{2,4,6\}\\
$\{8\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{4,5,6\}\\
$\{9\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{10\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{11\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3\}\\
$\{12\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{1,3,4\}&\{5,6,7,8\}\\
$\{13,57\}$&$S2$&\{2\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{13,57,61\}$&$S2$&\{2\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{4\}\\
$\{14,58,62\}$&none&\{4\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{4\}\\
$\{14,58\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{15,59\}$&none&\{5,6,7,9\}&\{4,5,6\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{16,60\}$&$S3$&\{6,7\}&\{4,5\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}\\
$\{16,60,63\}$&none&\{5,6,7,9\}&\{4,5,6\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{17\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{5\}\\
$\{18\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,5\}\\
$\{19\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{20,128\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{21,129\}$&$S1$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{3\}&\{5,6,7,8\}\\
$\{22,130\}$&none&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3\}\\
$\{23,131\}$&none&\{5,7\}&\{3,4\}&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{24,132\}$&none&$\emptyset$&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{25,133\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{26,48\}$&$S2$&\{3\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{2\}\\
$\{27,49\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{4\}\\
$\{28,50\}$&$S3$&\{4,5\}&\{2,3\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}\\
$\{29,42,51\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,4\}&\{5,6,7,8\}\\
$\{30,43,52\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3\}\\
$\{31,44,53\}$&none&\{3,5\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{32,45,54\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{33,46,55\}$&none&\{3,4\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{34,47,56\}$&none&\{4-8,10\}&\{2,3,5,6,7\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{35\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,4\}\\
$\{36\}$&$S2$&\{3\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{4\}\\
$\{37\}$&none&\{3\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{38\}$&none&\{3\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{39\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,5\}\\
$\{40\}$&$S2$&\{3\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{5\}\\
$\{41\}$&$S3$&\{4\}&\{3\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}\\
$\{61\}$&none&\{2\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{62\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{63\}$&$S3$&\{6,7\}&\{4\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}\\
$\{64,67,87,91\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{65,88\}$&none&\{2\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{65,68,88,91\}$&none&\{2\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{66,89\}$&none&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}&\{6,7\}\\
$\{66,69,89,92\}$&none&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}&\{4,5\}\\
$\{67,90\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{4\}\\
$\{68,91\}$&$S2$&\{2\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{69,92\}$&$S1$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{2,3\}&\{4,6\}\\
$\{70,93\}$&none&\{4,5\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{71,94\}$&none&\{5-9,11\}&\{3-8\}&\{2,3\}&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{72,95\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{2\}&\{3,4,5,7\}\\
$\{73,96\}$&$S1$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{2\}&\{4\}\\
$\{74,97\}$&none&\{4,6\}&\{2,3\}&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{75,98\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{4\}\\
$\{76\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,4\}\\
$\{77\}$&none&\{4\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{78\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{4\}\\
$\{79\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{3,5\}\\
$\{80\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{5\}\\
$\{81\}$&$S3$&\{6,8\}&\{4,5\}&\{0\}&$\emptyset$&$\emptyset$&\{0\}\\
$\{82\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,4\}&\{5-8\}\\
$\{83\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{84\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{3\}\\
$\{85\}$&none&$\emptyset$&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{86\}$&none&\{5,6,8\}&\{3,4,5\}&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{99,108\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{5\}\\
$\{99,104,108\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&$\emptyset$\\
$\{100,105,109\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{4\}\\
$\{101,110\}$&none&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3\}\\
$\{101,106,110\}$&none&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{4\}\\
$\{102,111\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{103,112\}$&none&\{3\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{103,107,112\}$&none&\{3\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{104\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{2\}\\
$\{105\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{106\}$&none&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{5,6\}\\
$\{107\}$&none&\{3\}&\{2\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{113\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{5\}\\
$\{114\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{115\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{116\}$&none&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3,5\}\\
$\{117\}$&none&\{5,6\}&\{3\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{118\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{119\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{120\}$&none&\{1\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{3\}\\
$\{121\}$&$S1$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{1,3\}&\{5-8\}\\
$\{122\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{3\}\\
$\{123\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&$\emptyset$\\
$\{124\}$&none&\{5,6\}&\{3\}&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$\\
$\{125\}$&none&$\emptyset$&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}&\{2,4,6\}\\
$\{126\}$&none&\{5,7\}&\{3,4\}&$\emptyset$&$\emptyset$&$\emptyset$&\{1\}\\
$\{127\}$&$S2$&$\emptyset$&\{0\}&$\emptyset$&$\emptyset$&\{0\}&\{4\}\\
\end{longtable}

\begin{longtable}{l|llllllll}
\caption{The number of IRR's of length $n$ derived by repeated applications of $F$ from a single IRR matching $\{73,96\}.5$ of length 3 subject to the Search Condition.\label{irr_counts_ex.2}}\\
IRR&\multicolumn{8}{c}{$n$}\\
outline&3&4&5&6&7&8&9&10\\\hline
$\{73,96\}$&1&0&1&0&2&0&4&0\\
$\{21,129\}$&0&1&0&2&0&4&0&8\\
$\{69,92\}$&0&0&1&0&2&0&4&0\\
$\{82\}$&0&1&0&2&0&4&0&8\\
$\{29,42,51\}$&0&1&0&2&0&4&0&8\\
$\{12\}$&0&1&0&2&0&4&0&8\\
$\{121\}$&0&1&0&2&0&4&0&8\\\hline
Total&1&5&2&10&4&20&8&40\\
\end{longtable}
\begin{longtable}{l|llllllll}
\caption{The number of IRR's derived by repeated applications of $F$ starting from all the IRR(3) of type LR and LL, in ascending order of difficulty, subject to the Search Condition.\label{irr_counts_total_r}}\\
Starting&\multicolumn{8}{c}{$n$}\\
IRR outline&3&4&5&6&7&8&9&10\\\hline
$\{1,2,3\}.4$&3&0&0&0&0&0&0&0\\
$\{5,6,8\}.3$&3&0&0&0&0&0&0&0\\
$\{9\}.5$&2&0&0&0&0&0&0&0\\
$\{17\}.2\times 3$&3&0&0&0&0&0&0&0\\
$\{20,128\}.5\times 2$&2&0&0&0&0&0&0&0\\
$\{99,108\}.4$&1&0&0&0&0&0&0&0\\
$\{102,111\}.4$&1&0&0&0&0&0&0&0\\
$\{113\}.2$&1&0&0&0&0&0&0&0\\
$\{114\}.2$&1&0&0&0&0&0&0&0\\
$\{115\}.2$&1&0&0&0&0&0&0&0\\
$\{119\}.5\times 2$&2&0&0&0&0&0&0&0\\
$\{73,96\}.5$,$\{66,89\}$&2&10&4&20&8&40&16&80\\
$\{66,89\}$&&&&&&&&\\
\hline
%Total&25&36&37&58&46&73&69&139\\
\end{longtable}
checked to here ***************

These results can be abbreviated by deleting column 3 and combining entries with the same value of column 2. While doing this it was noticed that the column 1 entries with non-empty intersection often give the same column 2 entry. In Table~\ref{irr_sets2} these sets of lines were replaced by a single line in which the column 1 entry is the union of the separate column 1 entries. These unions were also present in Table~ irr sets. There was also the case $\{101,106,110\}\stackrel{F}{\to}\{66,69,89,92\}$ which was deemed to include $\{106\}\stackrel{F}{\to}\{66,89\}$. This extra detail is only retained in Table~ irr sets.
Likewise for $\{107\}\stackrel{F}{\to}\{65,88\}$. The interpretation of Table~\ref{irr_sets2} is that any IRR matching any member of column 1 or a proper subset thereof under $F$ gives an IRR matching any corresponding member of column 2 or a proper subset thereof. For this to work, each set in column 2 must be replaced by the superset, which is one of the unions above, that it is a subset of.
\newpage
\begin{longtable}{ll}
\caption{Relations between sets of IRR outlines of types LL and LR under F\label{irr_sets2}}\\
Original set &Set of sets of \\
of IRR outlines&IRR outlines derived by F\\
$\{1\}$-$\{12\}$,$\{17\}$-$\{19\}$,$\{29,42,51\}$,$\{30,43,52\}$,&$\emptyset$\\
$\{35\}$,$\{39\}$,$\{64,67,87,90\}$,$\{72,95\}$,$\{76\}$,$\{82\}$&$\emptyset$\\
$\{99,104,108\}$,$\{100,105,109\}$,$\{113\}$,$\{114\}$&$\emptyset$\\
$\{118\}$,$\{119\}$&$\emptyset$\\
$\{13,57,61\}$&$\{18\},\{79\},\{39\},\{116\}$\\
$\{14,58,62\}$&$\{17\},\{80\},\{40\},\{113\}$\\
$\{15,59\}$,$\{16,60,63\}$&$\{19\},\{81\},\{41\},\{117\}$\\
$\{20,128\}$&$\{72,95\}$\\
$\{21,129\}$,$\{22,130\}$&$\{73,96\}$\\
$\{23,131\}$&$\{74,97\}$\\
$\{24,132\}$,$\{25,133\}$&$\{75,98\}$\\
$\{26,48\}$&$\{14,58\},\{76\},\{35\},\{3\},\{101,110\}$\\
$\{27,49\}$&$\{13,57\},\{78\},\{36\},\{1\},\{99,108\}$\\
$\{28,50\}$&$\{16,60\},\{77\},\{37\},\{3\},\{103,112\}$\\
$\{31,44,53\}$&$\{14,58,62\},\{76\},\{35\},\{3,5\},\{101,106,110\}$\\
$\{32,45,54\}$&$\{13,57,61\},\{78\},\{36\},\{1,4\},\{99,104,108\}$\\
$\{33,46,55\}$&$\{13,57,61\},\{78\},\{36\},\{1,4\},\{100,105,109\}$\\
$\{34,47,56\}$&$\{16,60,63\},\{77\},\{37\},\{3,5\},\{103,107,112\}$\\
$\{36\},\{40\}$&$\{62\},\{5\},\{106\}$\\
$\{37\}$&$\{61\},\{4\},\{104\}$\\
$\{38\}$&$\{61\},\{4\},\{105\}$\\
$\{41\}$&$\{63\},\{5\},\{107\}$\\
$\{61\}$&$\{18\},\{79\},\{39\},\{116\}$\\
$\{62\}$&$\{17\},\{80\},\{40\},\{113\}$\\
$\{63\}$&$\{19\},\{81\},\{41\},\{117\}$\\
$\{65,68,88,91\}$&$\{22,130\},\{84\},\{30,43,52\},\{11\},\{120\}$\\
$\{66,69,89,92\}$,$\{73,96\}$&$\{21,129\},\{82\},\{29,42,51\},\{12\},\{121\}$\\
$\{70,93\}$&$\{24,132\},\{85\},\{33,46,55\},\{10\},\{122\}$\\
$\{71,94\}$&$\{23,131\},\{86\},\{34,47,56\},\{12\},\{124\}$\\
$\{74,97\}$&$\{20,128\},\{85\},\{31,44,53\},\{9\},\{118\}$\\
$\{75,98\}$&$\{25,133\},\{83\},\{32,45,54\},\{12\},\{123\}$\\
$\{77\}$,$\{79\}$,$\{83\}$,$\{84\}$&$\{125\},\{26,48\},\{7\}$\\
$\{78\}$,$\{80\}$,$\{85\}$&$\{127\},\{27,49\},\{8\}$\\
$\{81\}$,$\{86\}$&$\{126\},\{28,50\},\{6\}$\\
$\{101,106,110\}$&$\{66,69,89,92\}$\\
$\{102,111\}$&$\{64,67,87,90\}$\\
$\{103,107,112\}$&$\{65,68,88,91\}$\\
$\{115\}$,$\{122\}$&$\{67,90\}$\\
$\{116\}$,$\{120\}$,$\{121\}$&$\{69,92\}$\\
$\{117\}$,$\{124\}$&$\{70,93\}$\\
$\{123\}$&$\{68,91\}$\\
$\{125\}$&$\{72,95\}$\\
$\{126\}$&$\{74,97\}$\\
$\{127\}$&$\{75,98\}$\\
\end{longtable}
Notice that $\{3,5\}$ has arisen as a distinct set of IRR outlines that does not appear in the LHS's of Table~ irr sets. Because both $\{3\}$ and $\{5\}$ lead to no new outlines under $F$, this should not be a problem.
In this table, many members of column 1 are a subset of other members of column 1. This should not be a problem in the analysis. The frequencies of these types of IRR will be shown separately in the subsequent analysis. 
These phenomena seem to be closely related with the fact that many IRR triplet outlines give under $F$ the same set of IRR triplet outlines e.g. ... because they occur with often the same original IRR outlines.
These sets of IRR outlines need to be identified.

Also cases were found where there were multiple derivations of an IRR outline under $F$ starting from a set of IRR outlines representing a single IRR. In these cases, the origin has an abbreviated form appearing multiple times.(e.g.). Because in these case each such origin appears only once, in the frequency analysis these cases will be combined e.g.



Many pairs of IRR outlines have the same set of derived IRR outlines. This explains why most occurrences of a subset of IRR outlines give the same result under $F$ as the full set of IRR outlines.
This results from some IRR having a subset of the origins of other ones, and the LHS and RHS the same.
Also some IRR have origins matching the outline multiple times.


Although this table is rather long, regularities make it easy to generate for example if IRR($n$) has an origin of the form $2\ldots x\un{y}$ then from \eqref{rev1} and the symbol $y$, the origins of the corresponding IRR($n+1$) can be written down immediately. Likewise for the LHS of IRR($n+1$), so only the RHS's require lookups in \eqref{1},\eqref{irr2}, or in the list of results starting from ex3 to the end of Section 1. The RHS's can often be copied from a previous set. The above sort order makes it easy to ensure closure i.e. every IRR($n+1$) outline of type LR or RL appears as an IRR($n$) outline. In most cases this involved just adding in any LHS states that were in the corresponding LHS of the IRR($n+1$) but not yet in the LHS of the IRR($n$). Sometimes extra IRR($n$) outlines were needed, needing a new set (they were numbered afterwards). 

Derived from this is the following, Table~\ref{tr_rel}, that shows all the relationships between the triplet outlines involved in Table~\ref{irr_2r.2}. Triplet outlines not of extendable type (LR or RL) i.e. where the pointer does not show in the RHS, are ignored. In Table~\ref{tr_rel}, as before, multiple triplet numbers on the left indicate that each one of these leads to all the triplet numbers on the right. The symbol $x$ (states of the LHS) after the set number and dot takes all possible values available in the LHS of the relations. When only one value is possible it is indicated.
\begin{longtable}{r@{\hspace{0.2em}}c@{\hspace{0.4em}}l}
\caption{Triplet relations derived from Table~\ref{irr_2r.2}\label{tr_rel}}\\
$\{25.x,28.x\}$&$\Rightarrow$&$\{49.x,3.x,82.x\}$\\
$\{26.x,29.x,30.x\}$&$\Rightarrow$&$\{48.x,1.x\}$\\
$\{27.x,31.3\}$&$\Rightarrow$&$\{51.x,3.x,84.x\}$\\
$\{32.x,35.x,37.x\}$&$\Rightarrow$&$\{53.x,5.x,85.x\}$\\
$\{33.x,34.4,38.x,39.x\}$&$\Rightarrow$&$\{52.x,4.x\}$\\
$\{36.x,40.3\}$&$\Rightarrow$&$\{54.x,5.x,86.x\}$\\
$41.x$&$\Rightarrow$&$13.x$\\
$\{42.x,45.x,46.x\}$&$\Rightarrow$&$\{12.x,65.x,32.x\}$\\
$\{43.x,47.3\}$&$\Rightarrow$&$\{15.x,64.x,33.x,89.x\}$\\
$44.x$&$\Rightarrow$&$\{13.x,87.x\}$\\
$\{48.x,52.x\}$&$\Rightarrow$&$\{17.x,66.x,91.x\}$\\
$\{49.x,53.x\}$&$\Rightarrow$&$\{16.x,67.x,35.x\}$\\
$\{50.4,51.x,54.x\}$&$\Rightarrow$&$\{18.x,68.x,36.x,92.x\}$\\
$\{55.x,57.x\}$&$\Rightarrow$&$\{21.x,70.x,93.x\}$\\
$\{56.x,58.x,61.x\}$&$\Rightarrow$&$\{20.x,94.x\}$\\
$59.x$&$\Rightarrow$&$\{23.x,71.x,39.x,95.x\}$\\
$60.3$&$\Rightarrow$&$\{22.3,72.3,40.3,97.3\}$\\
$62.x$&$\Rightarrow$&$\{19.x,71.x,37.x\}$\\
$63.x$&$\Rightarrow$&$\{24.x,69.x,38.x,96.x\}$\\
$\{64.x,66.x,69.x,70.x\}$&$\Rightarrow$&$\{98.x,25.x,41.x,6.x\}$\\
$\{65.x,67.x,71.x\}$&$\Rightarrow$&$\{100.x,26.x,42.x,7.x\}$\\
$\{68.x,72.3\}$&$\Rightarrow$&$\{99.x,27.x,43.x\}$\\
$\{73.x,75.x\}$&$\Rightarrow$&$\{103.x,10.x\}$\\
$\{74.x,76.x,79.x\}$&$\Rightarrow$&$\{102.x,11.x\}$\\
$77.x$&$\Rightarrow$&$\{105.x,30.x,46.x,9.x\}$\\
$78.3$&$\Rightarrow$&$\{104.3,31.3,47.3,11.3\}$\\
$80.x$&$\Rightarrow$&$\{101.x,28.x,44.x,8.x\}$\\
$81.x$&$\Rightarrow$&$\{106.x,29.x,45.x,11.x\}$\\
$\{82.x,85.x\}$&$\Rightarrow$&$\{56.x,74.x\}$\\
$\{84.x,86.x\}$&$\Rightarrow$&$\{55.x,73.x\}$\\
$\{87.x,91.x,93.x,94.x\}$&$\Rightarrow$&$\{58.x,76.x\}$\\
$\{89.x,96.x\}$&$\Rightarrow$&$\{57.x,75.x\}$\\
$\{92.x,97.3\}$&$\Rightarrow$&$\{59.x,77.x\}$\\
$\{99.x,104.3\}$&$\Rightarrow$&$\{62.x,80.x\}$\\
$\{100.x,105.x,106.x\}$&$\Rightarrow$&$\{63.x,81.x\}$\\
$\{102.x,103.x\}$&$\Rightarrow$&$\{61.x,79.x\}$\\
$\{1.x-24.x,83.4,88.4,90.2,95.x,98.x,101.x\}$&$\Rightarrow$&$\emptyset$\\
\end{longtable}

Not all the RHS's of these relations are disjoint. Numbers $3,5,13\text{ and }71$ occur twice and $11$ occurs 3 times and the following are missing from the RHS's $2,14,34,50,60,78,83,88,\text{ and }90$.

The following cycles (having many overlaps and divided into 3 disjoint groups) 
\begin{equation}\label{cycles}\begin{array}{l}
79\Leftrightarrow 102\\
58\Leftrightarrow 94\\
76\Rightarrow 102\Rightarrow 61\Rightarrow 94\Rightarrow 76\\
\\
54\Leftrightarrow 36\\
51\Rightarrow68\Rightarrow27\Rightarrow51\\
54\Rightarrow 68\Rightarrow 27\Rightarrow 51\Rightarrow 36\Rightarrow 54\\
\\
35\Leftrightarrow 53\\
65\Leftrightarrow 42\\
106\Leftrightarrow 81\\
45\Rightarrow65\Rightarrow100\Rightarrow81\Rightarrow45\\
32\Rightarrow53\Rightarrow67\Rightarrow42\Rightarrow32\\
25\Rightarrow 49\Rightarrow 67\Rightarrow 100\Rightarrow 63\Rightarrow 69\Rightarrow 25\\
49\Rightarrow35\Rightarrow53\Rightarrow67\Rightarrow100\Rightarrow63\Rightarrow38\Rightarrow52\Rightarrow66\Rightarrow25\Rightarrow49\\
63\Rightarrow38\Rightarrow52\Rightarrow66\Rightarrow25\Rightarrow49\Rightarrow67\Rightarrow100\Rightarrow63\\
65\Rightarrow100\Rightarrow63\Rightarrow69\Rightarrow25\Rightarrow49\Rightarrow67\Rightarrow42\Rightarrow65\\
100\Rightarrow 81\Rightarrow45\Rightarrow32\Rightarrow53\Rightarrow67\Rightarrow100\\
49\Rightarrow67\Rightarrow100\Rightarrow81\Rightarrow29\Rightarrow48\Rightarrow66\Rightarrow25\Rightarrow49\\
\end{array}\end{equation}
were found in \ref{tr_rel} by attempting to draw out the complete graph and noticing when a new edge (connection) is added whether or not any new cycles were obvious. The importance of cycles is that they show that there are an infinite number of IRR and allow a recursive definition to be made which defines an infinite subset of the IRR. Searching for cycles was done more systematically leading to Table~\ref{res2}. This lists (1) each set (node) in Table~\ref{tr_rel},(2) the strongly connected component (SCC) it is in ($\in S=\{C1,C2,C3\}$) except for those SCC's that have just a single set (single node), (3-5) whether or not there is a path from the starting node to each member of $S$ in a search that ends when a node (except the starting node) found is in $S$ or is a terminating node,(6) ``order" which represents the order of derivation. This is the length of the longest path from the starting node to any node in $S$ or a terminating node. 

Table~\ref{res2} can be verified by first establishing that all pairs of sets in $C1$ connect to each other (directly or indirectly) in both directions. Likewise for $C2$, and $C3$. This can be done by first picking out all relations with both members in the same member of $S$ and chaining these together. Thus they are subsets of SCC's. Then the other columns of Table~\ref{res2} can be verified easily in any order such that ``order" is non-decreasing. Doing this will show that every path from any member of $S$ to another one is one of
\begin{equation}\begin{array}{l}C2\to C1\\C2\to C3\\C3\to C1\\\end{array}.\end{equation}
Therefore for each set in $C1$, there is no path to a set outside $C1$ and then back into it. If there was such a path all the intermediate sets would have to be included in $C1$. Likewise for $C2$ and $C3$. This shows that members of $S$ are maximal that is they are indeed SCC's. Table~\ref{res2} could presumably be obtained by an extension of Tarjan's algorithm for obtaining the SCC's from a directed graph.

\begin{longtable}{lccccl}
\caption{Resolution of the directed graph defined by Table~\ref{tr_rel}\label{res2}}\\
set&SCC&$\to C1$&$\to C2$&$\to C3$&order\\
$1-24$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$25$&$C3$&\checkmark&\ding{55}&\checkmark&3\\
$26$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$27$&$C2$&\checkmark&\checkmark&\checkmark&4\\
$28$&none&\checkmark&\ding{55}&\checkmark&3\\
$29$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$30$&none&\ding{55}&\ding{55}&\checkmark&1\\
$31$&none&\checkmark&\checkmark&\checkmark&4\\
$32$&$C3$&\checkmark&\ding{55}&\checkmark&3\\
$33$&none&\ding{55}&\ding{55}&\checkmark&1\\
$34$&none&\ding{55}&\ding{55}&\checkmark&1\\
$35$&$C3$&\checkmark&\ding{55}&\checkmark&3\\
$36$&$C2$&\checkmark&\checkmark&\checkmark&4\\
$37$&none&\checkmark&\ding{55}&\checkmark&3\\
$38$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$39$&none&\ding{55}&\ding{55}&\checkmark&1\\
$40$&none&\checkmark&\checkmark&\checkmark&4\\
$41$&none&\ding{55}&\ding{55}&\ding{55}&1\\
$42$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$43$&none&\checkmark&\ding{55}&\checkmark&4\\
$44$&none&\checkmark&\ding{55}&\ding{55}&2\\
$45$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$46$&none&\ding{55}&\ding{55}&\checkmark&1\\
$47$&none&\checkmark&\ding{55}&\checkmark&4\\
$48$&$C3$&\checkmark&\ding{55}&\checkmark&2\\
$49$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$50$&none&\ding{55}&\checkmark&\checkmark&4\\
$51$&$C2$&\ding{55}&\checkmark&\checkmark&4\\
$52$&$C3$&\checkmark&\ding{55}&\checkmark&2\\
$53$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$54$&$C2$&\ding{55}&\checkmark&\checkmark&4\\
$55$&none&\checkmark&\ding{55}&\checkmark&2\\
$56$&none&\checkmark&\ding{55}&\ding{55}&1\\
$57$&$C3$&\checkmark&\ding{55}&\checkmark&2\\
$58$&$C1$&\checkmark&\ding{55}&\ding{55}&1\\
$59$&none&\ding{55}&\ding{55}&\checkmark&2\\
$60$&none&\checkmark&\checkmark&\checkmark&7\\
$61$&$C1$&\checkmark&\ding{55}&\ding{55}&1\\
$62$&none&\checkmark&\ding{55}&\checkmark&4\\
$63$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$64$&none&\ding{55}&\ding{55}&\checkmark&2\\
$65$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$66$&$C3$&\ding{55}&\ding{55}&\checkmark&2\\
$67$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$68$&$C2$&\checkmark&\checkmark&\checkmark&6\\
$69$&$C3$&\ding{55}&\ding{55}&\checkmark&2\\
$70$&$C3$&\ding{55}&\ding{55}&\checkmark&2\\
$71$&none&\ding{55}&\ding{55}&\checkmark&1\\
$72$&none&\checkmark&\checkmark&\checkmark&6\\
$73$&none&\checkmark&\ding{55}&\ding{55}&2\\
$74$&none&\checkmark&\ding{55}&\ding{55}&1\\
$75$&none&\checkmark&\ding{55}&\ding{55}&2\\
$76$&$C1$&\checkmark&\ding{55}&\ding{55}&1\\
$77$&none&\ding{55}&\ding{55}&\checkmark&2\\
$78$&none&\checkmark&\checkmark&\checkmark&6\\
$79$&$C1$&\checkmark&\ding{55}&\ding{55}&1\\
$80$&none&\checkmark&\ding{55}&\checkmark&4\\
$81$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$82$&none&\checkmark&\ding{55}&\ding{55}&2\\
$83$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$84$&none&\checkmark&\ding{55}&\checkmark&3\\
$85$&none&\checkmark&\ding{55}&\ding{55}&2\\
$86$&none&\checkmark&\ding{55}&\checkmark&3\\
$87$&none&\checkmark&\ding{55}&\ding{55}&1\\
$88$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$89$&none&\checkmark&\ding{55}&\checkmark&3\\
$90$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$91$&none&\checkmark&\ding{55}&\ding{55}&1\\
$92$&none&\ding{55}&\ding{55}&\checkmark&3\\
$93$&none&\checkmark&\ding{55}&\ding{55}&1\\
$94$&$C1$&\checkmark&\ding{55}&\ding{55}&1\\
$95$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$96$&$C3$&\checkmark&\ding{55}&\checkmark&3\\
$97$&none&\ding{55}&\ding{55}&\checkmark&3\\
$98$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$99$&none&\checkmark&\ding{55}&\checkmark&5\\
$100$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
$101$&none&\ding{55}&\ding{55}&\ding{55}&0\\
$102$&$C1$&\checkmark&\ding{55}&\ding{55}&1\\
$103$&none&\checkmark&\ding{55}&\ding{55}&1\\
$104$&none&\checkmark&\ding{55}&\checkmark&5\\
$105$&none&\ding{55}&\ding{55}&\checkmark&1\\
$106$&$C3$&\ding{55}&\ding{55}&\checkmark&1\\
\end{longtable}
******************
\subsection{Using the directed graph of relations amongst IRR outlines to count derived IRR's}

\begin{longtable}{lll}
\caption{Members of IRR(3) of types LL and LR and their corresponding sets of IRR outlines from Table~\ref{irr_2r.2}\label{corr2}}\\
IRR(3) member&set of IRR outlines&multiplicity\\
\eqref{irr3.40}&$\{17\}.2$&3\\
\eqref{irr3.41}&$\{80\}.2$&3\\
\eqref{irr3.42}&$\{40\}.2$&3\\
\eqref{irr3.43}$.a$&$\{114\}.2$&1\\
\eqref{irr3.43}$.c$&$\{113\}.2$&1\\
\eqref{irr3.43}$.d$&$\{115\}.2$&1\\
\eqref{irr3.44}&$\{66,89\}.2$&3\\
\eqref{irr3.46_1}&$\{126\}.3$&1\\
\eqref{irr3.46_2}&$\{28,50\}.3$&1\\
\eqref{irr3.46_3}&$\{6\}.3$&1\\
\eqref{irr3.47_1}&$\{127\}.3$&1\\
\eqref{irr3.47_2}&$\{27,49\}.3$&1\\
\eqref{irr3.47_3}&$\{8\}.3$&1\\
\eqref{irr3.48}.1&$\{63\}.3$&1\\
\eqref{irr3.48}.2&$\{5\}.3$&1\\
\eqref{irr3.48}.3&$\{107\}.3$&1\\
\eqref{irr3.49}&$\{70,93\}.3$&1\\
\eqref{irr3.50}&$\{71,94\}.3$&1\\
\eqref{irr3.55_1}$.b$&$\{16,60\}.4$&1\\
\eqref{irr3.55_1}$.c$&$\{13,57\}.4$&1\\
\eqref{irr3.55_1}$.e$&$\{15,59\}.4$&1\\
\eqref{irr3.55_2}$.b$&$\{77\}.4$&1\\
\eqref{irr3.55_2}$\{.c,.e\}$&$\{78\}.4$&2\\
\eqref{irr3.55_3}$.b$&$\{37\}.4$&1\\
\eqref{irr3.55_3}$.c$&$\{36\}.4$&1\\
\eqref{irr3.55_3}$.e$&$\{38\}.4$&1\\
\eqref{irr3.55_4}$.b$&$\{3\}.4$&1\\
\eqref{irr3.55_4}$.c$&$\{1\}.4$&1\\
\eqref{irr3.55_4}$.e$&$\{2\}.4$&1\\
\eqref{irr3.55_5}$.b$&$\{103,112\}.4$&1\\
\eqref{irr3.55_5}$.c$&$\{99,108\}.4$&1\\
\eqref{irr3.55_5}$.e$&$\{102,111\}.4$&1\\
\eqref{irr3.56_1}&$\{75,98\}.4$&1\\
\eqref{irr3.56_2}&$\{73,96\}.4$&1\\
\eqref{irr3.62_1}&$\{20,128\}.5$&2\\
\eqref{irr3.62_2}&$\{85\}.5$&2\\
\eqref{irr3.62_3}&$\{31,44,53\}.5$&2\\
\eqref{irr3.62_4}&$\{9\}.5$&2\\
\eqref{irr3.62_5}&$\{119\}.5$&2\\
\end{longtable}



The following is the list of sets obtained from \ref{irr_2r.2} which are the starting points for the generation of the IRR. 
\begin{equation}\label{initials}\begin{array}{l}
1.4,2.4,3.4,5.3,7.3,8.5,12.4,14.4,15.4,16.2,19.5,26.3,27.3,\\
28.5,32.4,33.4,34.4,35.2,37.5,42.3,43.3,44.5,48.4,50.4,51.4,\\
54.3,56.2,59.3,60.3,61.4,63.4,64.4,65.4,67.2,71.5,74.2,77.3,\\
78.3,79.4,81.4,83.4,84.4,86.3,88.4,89.4,90.2,99.3,100.3,101.5\\
\end{array}
\end{equation}

The purpose of deriving Table~\ref{irr_2r.2}, the relations derived from it Table~\ref{tr_rel} and the resolution of it into SCC's and SCC reachability relations Table res, is to be able to use the latter to define recursively an infinite subset of the IRR, and ultimately do this for all the IRR. To show how this can be done, consider first just SCC $C1$ and those IRR that can be obtained starting from those matching sets 79.4 and 61.4 in $C1$.
First note that from Theorem~\ref{irr_ind_thm}, if IRR outlines $X$ and $Y$ satisfy the relation $X\Rightarrow Y$ and if two distinct IRR $r1$ and $r2$ match $X$ then distinct derived IRR, say $s1$ and $s2$ will match $Y$. Likewise if $X1$ and $X2$ are distinct outlines matching distinct IRR $r1$ and $r2$ respectively, and $X1\Rightarrow Y$ and $X2\Rightarrow Y$ then there are two distinct IRR say $s1$ and $s2$ derived from $r1$ and $r2$ respectively which match $Y$. Now it should be clear how this can be used to count the IRR derived from the set 79.4 in IRR(3) as in the following table.
\begin{longtable}{llllllll}
\caption{Counting the IRR derived from set $79.4$\label{count1}}\\
total\#&$n$&$58.4$&$61.4$&$76.4$&$79.4$&$94.4$&$102.4$\\
1&3&0&0&0&1&0&0\\
1&4&0&0&0&0&0&1\\
2&5&0&1&0&1&0&0\\
2&6&0&0&0&0&1&1\\
4&7&1&1&1&1&0&0\\
4&8&0&0&0&0&2&2\\
8&9&2&2&2&2&0&0\\
\ldots&&&&&&&\\
\end{longtable}
from which it is clear that the numbers now double for an increase of $n$ by 2. When the calculation is done similarly for $C2$ it is a little more complicated because there are cycles of length 2,3, and 5 giving
\begin{longtable}{lllllll}
\caption{Counting the IRR derived from set $27.3$\label{count2}}\\
total\#&$n$&$27.3$&$36.3$&$51.3$&$54.3$&$68.3$\\
1&3&1&0&0&0&0\\
1&4&0&0&1&0&0\\
2&5&0&1&0&0&1\\
2&6&1&0&0&0&1\\
3&7&0&1&1&0&1\\
4&8&1&1&0&1&1\\
5&9&1&1&1&1&1\\
7&10&1&2&1&1&2\\
9&11&2&2&1&2&2\\
12&12&2&3&2&2&3\\
16&13&3&4&2&3&4\\
\ldots&&&&&&\\
\end{longtable}
Likewise this could be done starting from each of the sets in \eqref{initials} noticing that in most of these cases the initial sets are not in an SCC so paths to the SCC's must be first traced out.



\section{old stuff}

To make things simpler, in the first instance, the IRR outlines were further abbreviated thus
incorporating more IRR in each outline IRR, by deleting the state of the LHS and all the RHS. Duplicates of IRR outlines were eliminated thus shortening the table. The table was then checked for closure i.e. every outline IRR$(n+1)$ must also appear as an outline IRR($n$) and the argument would have been repeated to generate the IRR($n+1$) from these etc. until closure was obtained. In this case however the procedure quickly came to an end. This is indicated by the smallest $n$ value being 4 for only sets $14$ and $19$. Each of these outlines IRR($n$) appeared as IRR($n+1$) but were not obtained by abbreviating entries in Table~\ref{ind1}.

This was done first for those results with the arbitrary symbols $\ldots$ on the right, giving Table~\ref{irr2_relationships}. The meaning of Table~\ref{irr2_relationships} is as follows: for each IRR($n$) outline, if there is an IRR matching it of length $n$, all the IRR($n+1$) derived from it as above must match one of the set of IRR outlines corresponding to it in the right hand part of the table. 
\begin{longtable}{c|cll|ll}
\caption{Recursive definition of a superset of some of the IRR\label{irr2_relationships}}\\
set number&smallest&\multicolumn{2}{c|}{IRR($n$)}&\multicolumn{2}{c}{IRR($n+1$)}\\
&$n$&Origin&LHS&Origin&LHS\\
\hline
$1$&3&$1\un{d}a\ldots$&$bc\ldots$&$2\un{d}d\ldots$&$ab\ldots$\\
&&&&$2\un{a}d\ldots$&$cb\ldots$\\
&&&&$2\un{c}d\ldots$&$db\ldots$\\\hline
$2$&3&$1\un{d}c\ldots$&$bd\ldots$&$2\un{d}d\ldots$&$ab\ldots$\\
&&&&$2\un{a}d\ldots$&$cb\ldots$\\
&&&&$2\un{c}d\ldots$&$db\ldots$\\\hline
$3$&3&$1\un{d}d\ldots$&$ba\ldots$&$2\un{d}d\ldots$&$ab\ldots$\\
&&&&$2\un{a}d\ldots$&$cb\ldots$\\
&&&&$2\un{c}d\ldots$&$db\ldots$\\\hline
$4$&3&$1\un{e}a\ldots$&$bc\ldots$&$2\un{d}e\ldots$&$ab\ldots$\\
&&&&$2\un{a}e\ldots$&$cb\ldots$\\
&&&&$2\un{c}e\ldots$&$db\ldots$\\\hline
$5$&3&$1\un{e}c\ldots$&$bd\ldots$&$2\un{d}e\ldots$&$ab\ldots$\\
&&&&$2\un{a}e\ldots$&$cb\ldots$\\
&&&&$2\un{c}e\ldots$&$db\ldots$\\\hline
$6$&3&$1\un{e}d\ldots$&$ba\ldots$&$2\un{d}e\ldots$&$ab\ldots$\\
&&&&$2\un{a}e\ldots$&$cb\ldots$\\
&&&&$2\un{c}e\ldots$&$db\ldots$\\\hline
$7$&3&$2\un{a}d\ldots$&$cb\ldots$&$1\un{d}a\ldots$&$bc\ldots$\\
&&&&$1\un{e}a\ldots$&$bc\ldots$\\\hline
$8$&3&$2\un{a}e\ldots$&$cb\ldots$&$1\un{d}a\ldots$&$bc\ldots$\\
&&&&$1\un{e}a\ldots$&$bc\ldots$\\\hline
$9$&3&$2\un{c}d\ldots$&$db\ldots$&$1\un{d}c\ldots$&$bd\ldots$\\
&&&&$1\un{e}c\ldots$&$bd\ldots$\\\hline
$10$&3&$2\un{c}e\ldots$&$db\ldots$&$1\un{d}c\ldots$&$bd\ldots$\\
&&&&$1\un{e}c\ldots$&$bd\ldots$\\\hline
$11$&3&$2\un{d}d\ldots$&$ab\ldots$&$1\un{d}d\ldots$&$ba\ldots$\\
&&&&$1\un{e}d\ldots$&$ba\ldots$\\\hline
$12$&3&$2\un{d}e\ldots$&$ab\ldots$&$1\un{d}d\ldots$&$ba\ldots$\\
&&&&$1\un{e}d\ldots$&$ba\ldots$\\\hline
$13$&3&$3\un{a}b\ldots$&$cb\ldots$&$5\un{c}a\ldots$&$ac\ldots$\\
&&&&$5\un{e}a\ldots$&$ac\ldots$\\
&&&&$3\un{e}a\ldots$&$bc\ldots$\\
&&&&$4\un{c}a\ldots$&$cc\ldots$\\\hline
$14$&4&$3\un{a}c\ldots$&$cc\ldots$&$5\un{c}a\ldots$&$ac\ldots$\\
&&&&$5\un{e}a\ldots$&$ac\ldots$\\
&&&&$3\un{e}a\ldots$&$bc\ldots$\\
&&&&$4\un{c}a\ldots$&$cc\ldots$\\\hline
$15$&3&$3\un{a}e\ldots$&$ca\ldots$&$5\un{c}a\ldots$&$ac\ldots$\\
&&&&$5\un{e}a\ldots$&$ac\ldots$\\
&&&&$3\un{e}a\ldots$&$bc\ldots$\\
&&&&$4\un{c}a\ldots$&$cc\ldots$\\\hline
$16$&3&$3\un{e}a\ldots$&$bc\ldots$&$5\un{c}e\ldots$&$ab\ldots$\\
&&&&$5\un{e}e\ldots$&$ab\ldots$\\
&&&&$3\un{e}e\ldots$&$bb\ldots$\\
&&&&$4\un{c}e\ldots$&$cb\ldots$\\\hline
$17$&3&$3\un{e}e\ldots$&$bb\ldots$&$5\un{c}e\ldots$&$ab\ldots$\\
&&&&$5\un{e}e\ldots$&$ab\ldots$\\
&&&&$3\un{e}e\ldots$&$bb\ldots$\\
&&&&$4\un{c}e\ldots$&$cb\ldots$\\\hline
$18$&3&$4\un{b}b\ldots$&$bb\ldots$&$4\un{b}b\ldots$&$bb\ldots$\\
&&&&$3\un{a}b\ldots$&$cb\ldots$\\\hline
$19$&4&$4\un{b}c\ldots$&$bc\ldots$&$4\un{b}b\ldots$&$bb\ldots$\\
&&&&$3\un{a}b\ldots$&$cb\ldots$\\\hline
$20$&3&$4\un{b}e\ldots$&$ba\ldots$&$4\un{b}b\ldots$&$bb\ldots$\\
&&&&$3\un{a}b\ldots$&$cb\ldots$\\\hline
$21$&3&$4\un{c}a\ldots$&$cc\ldots$&$4\un{b}c\ldots$&$bc\ldots$\\
&&&&$3\un{a}c\ldots$&$cc\ldots$\\\hline
$22$&3&$4\un{c}e\ldots$&$cb\ldots$&$4\un{b}c\ldots$&$bc\ldots$\\
&&&&$3\un{a}c\ldots$&$cc\ldots$\\\hline
$23$&3&$4\un{e}c\ldots$&$aa\ldots$&$4\un{b}e\ldots$&$ba\ldots$\\
&&&&$3\un{a}e\ldots$&$ca\ldots$\\\hline
$24$&3&$4\un{e}e\ldots$&$aa\ldots$&$4\un{b}e\ldots$&$ba\ldots$\\
&&&&$3\un{a}e\ldots$&$ca\ldots$\\\hline
$25$&3&$5\un{c}a\ldots$&$ac\ldots$&$4\un{e}c\ldots$&$aa\ldots$\\\hline
$26$&3&$5\un{c}e\ldots$&$ab\ldots$&$4\un{e}c\ldots$&$aa\ldots$\\\hline
$27$&3&$5\un{e}a\ldots$&$ac\ldots$&$4\un{e}e\ldots$&$aa\ldots$\\\hline
$28$&3&$5\un{e}e\ldots$&$ab\ldots$&$4\un{e}e\ldots$&$aa\ldots$\\\hline
\end{longtable}
Thus an infinite number of IRR can be captured by a recursive description of this type, and the exact set captured is determined by the initial set of known IRR that each match one of the patterns. Note that not all rules matching the patterns are necessarily IRR.

One consequence of this last stage of abbreviation of the IRR outlines is that the information in the RHS has been lost, in particular the type of the IRR i.e. determining whether or not it is extendable to an IRR one symbol longer. Thus in Table~\ref{irr2_relationships} some IRR outlines can be vacuous i.e. have no matching IRR. This happens when an IRR($n$) outline has no matching IRR that are of extendable types RL or LR. Further work with the full IRR outlines above will attempt to refine this.

Apart from this, because of the restriction on the direction of the movement of the pointer in the derivation of origins, in general not all the IRR are obtained like this. This restriction will be systematically overcome.
%\pagebreak
\begin{longtable}{l|l|l}
\caption{Analysis of the simultaneous induction defined by Table~\ref{irr2_relationships}\label{irr3_relationships}}\\
Initial conditions&Implication statements& results\\
\hline
$17(n=\text{3})$&$17\Rightarrow 17$&$17(n\ge\text{3})$\\
$22(n=\text{3})$&$17\Rightarrow 22$&$22(n\ge\text{3})$\\
$2(n=\text{3})$ and $9(n=\text{3})$&$9\Leftrightarrow 2$ &$2(n\ge\text{3})$ and $9(n\ge\text{3})$\\
$5(n=\text{3})$ and $10(n=\text{3})$&$5\Leftrightarrow 10$&$5(n\ge \text{3})$ and $10(n\ge \text{3})$\\
$7(n=\text{3})$&$2\Rightarrow 7$&$7(n\ge \text{3})$\\
$12(n=\text{3})$&$5\Rightarrow 12$&$12(n\ge\text{3})$\\
$8(n=\text{3})$&$5\Rightarrow 8$& $8(n\ge\text{3})$\\
$1(n=\text{3})$&$7\Rightarrow 1$&$1(n\ge\text{3})$\\
$4(n=\text{3})$&$7\Rightarrow 4$&$4(n\ge\text{3})$\\
$3(n=\text{3})$&$12\Rightarrow 3$&$3(n\ge \text{3})$\\
$6(n=\text{3})$&$12\Rightarrow 6$&$6(n\ge \text{3})$\\
$11(n=\text{3})$&$1\Rightarrow 11$&$11(n\ge\text{3})$\\
$14(n=\text{4})$ and $21(n=\text{3})$&$14\Leftrightarrow 21$&$14(n\text{ even and }n\ge\text{4})$\\
&&$21(n\text{ odd and }n\ge\text{3})$\\
&$21\Rightarrow 19$&$19(n\text{ even and }n\ge\text{4})$\\
$13(n=\text{3})$&$19\Rightarrow 13$&$13(n\text{ odd and }n\ge\text{3})$\\
$18(n=\text{3})$&$19\Rightarrow 18$&$18(n\text{ odd and }n\ge\text{3})$\\
$13(n=\text{3})$&$18\Rightarrow 13$&$13(n\text{ even and }n\ge\text{4})$\\
&&$13(n\ge\text{3})$\\
$16(n=\text{3})$&$13\Rightarrow 16$&$16(n\ge\text{3})$\\
$28(n=\text{3})$&$16\Rightarrow 28$&$28(n\ge\text{3})$\\
$24(n=\text{3})$&$28\Rightarrow 24$&$24(n\ge\text{3})$\\
$26(n=\text{3})$&$16\Rightarrow 26$&$26(n\ge\text{3})$\\
$23(n=\text{3})$&$26\Rightarrow 23$&$23(n\ge\text{3})$\\
$15(n=\text{3})$&$23\Rightarrow 15$&$15(n\ge\text{3})$\\
$21(n=\text{3})$&$13\Rightarrow 21$&$21(n\ge\text{3})$\\
$25(n=\text{3})$&$13\Rightarrow 25$&$25(n\ge\text{3})$\\
$27(n=\text{3})$&$13\Rightarrow 27$&$27(n\ge\text{3})$\\
$19(n=\text{4})$&$21\Rightarrow 19$&$19(n\ge\text{4})$\\
$20(n=\text{3})$&$24\Rightarrow 20$&$20(n\ge\text{3})$\\
$18(n=\text{3})$&$20\Rightarrow 18$&$18(n\ge\text{3})$\\
$14(n=\text{4})$&$21\Rightarrow 14$&$14(n\ge\text{4})$\\
\hline
\end{longtable}
To avoid repeated use of the phrase ``is/are true for", the statement number is given followed by the conditions on $n$ in parentheses.
In Table~\ref{irr3_relationships} the sets in Table~\ref{irr2_relationships} are referred to by number (using monospaced typewriter font and not to be confused with the symbols), so for example the first set will be written as $1\Rightarrow 11$ , $1\Rightarrow 7$ and $1\Rightarrow 9$. That $n$ is increased by one on the RHS will be implicit because this is always the case.
In this way a directed graph can be constructed from Table~\ref{irr2_relationships} indicating the implication statements one for each row.
The implication statement is ``if there is an IRR $r$ of length n of type RL or LR matching the column IRR($n$) then there is an IRR $r'$ of length $n+1$ derived from $r$ matching each of the outlines corresponding to it in column IRR($n+1$). Because the type of $r'$ is not indicated in Table~\ref{irr2_relationships}, the closure procedure will in general yield some outlines not corresponding to any IRR.

The point of the closure procedure was to attempt the simultaneous proof by induction that determines the set of values of $n$ that apply to each set in Table~\ref{irr2_relationships}. Table~\ref{irr3_relationships} is listed in the order in which the derivation can proceed. It was obtained by first searching for cycles in the directed graph, first shorter ones then longer ones, because they allow induction arguments to be made. Then many implication statements allow other consequent statements to be made. 

By noting the state of the LHS in each set of IRR outlines in Table~\ref{irr2_relationships}, which is the same for the IRR($n$) and derived IRR($n+1$ outlines), it is possible to find all possible states of the LHS's for each set number by carrying them forward to the derived IRR outlines for next value of $n$. It turns out that statements $1-12$ can have the state of the LHS as $1$ or $2$, and statements $13-28$ can have the state of the LHS $\in\{3,4,5\}$. This argument should be extended to establish the set of values of $n$ and the RHS's for each of these states.

The analogous computations will now be carried out starting from the subset of Table~\ref{ind1}
with $\ldots$ on the left in each CS before returning to using the original IRR outlines, and taking account of unexpected pointer movement in the derivation of origins.
\subsection{Repeating the analysis for the entries of Table~\ref{ind1} with the unknown symbols on the left}
Here the arbitrary symbols on the left, giving Table~\ref{irr4_relationships}. 




\begin{longtable}{c|ll|ll}
\caption{Recursive definition of a subset of the IRR of type LR\label{irr4_relationships}}\\
set number&\multicolumn{2}{c|}{IRR($n$)}&\multicolumn{2}{c}{IRR($n+1$)}\\
&Origin&LHS&Origin&LHS\\
\hline
$1$&$1\ldots b\un{a}$&$\ldots cd$&$\emptyset$&\\\hline
$2$&$1\ldots e\un{a}$&$\ldots cd$&$\emptyset$&\\\hline
$3$&$1\ldots a\un{b}$&$\ldots bd$&$\emptyset$&\\\hline
$4$&$1\ldots d\un{b}$&$\ldots cd$&$\emptyset$&\\\hline
$5$&$1\ldots b\un{c}$&$\ldots ca$&$\emptyset$&\\\hline
$6$&$1\ldots c\un{c}$&$\ldots aa$&$\emptyset$&\\\hline
$7$&$1\ldots d\un{c}$&$\ldots ca$&$\emptyset$&\\\hline
$8$&$2\ldots a\un{b}$&$\ldots bc$&$3\ldots b\un{c}$&$\ldots ca$\\
&&&$1\ldots b\un{a}$&$\ldots cd$\\
&&&$5\ldots b\un{a}$&$\ldots ce$\\\hline
$9$&$2\ldots d\un{b}$&$\ldots cc$&$3\ldots b\un{c}$&$\ldots ca$\\
&&&$1\ldots b\un{a}$&$\ldots cd$\\
&&&$5\ldots b\un{a}$&$\ldots ce$\\\hline
$10$&$2\ldots b\un{e}$&$\ldots cc$&$3\ldots e\un{c}$&$\ldots ca$\\
&&&$1\ldots e\un{a}$&$\ldots cd$\\
&&&$5\ldots e\un{a}$&$\ldots ce$\\\hline
$11$&$2\ldots c\un{e}$&$\ldots ac$&$3\ldots e\un{c}$&$\ldots ca$\\
&&&$1\ldots e\un{a}$&$\ldots cd$\\
&&&$5\ldots e\un{a}$&$\ldots ce$\\\hline
$12$&$2\ldots d\un{e}$&$\ldots cc$&$3\ldots e\un{c}$&$\ldots ca$\\
&&&$1\ldots e\un{a}$&$\ldots cd$\\
&&&$5\ldots e\un{a}$&$\ldots ce$\\\hline
$13$&$3\ldots a\un{b}$&$\ldots bc$&$1\ldots b\un{c}$&$\ldots ca$\\
&&&$4\ldots b\un{a}$&$\ldots cb$\\
&&&$2\ldots b\un{e}$&$\ldots cc$\\
&&&$5\ldots b\un{b}$&$\ldots ce$\\\hline
$14$&$3\ldots d\un{b}$&$\ldots cc$&$1\ldots b\un{c}$&$\ldots ca$\\
&&&$4\ldots b\un{a}$&$\ldots cb$\\
&&&$2\ldots b\un{e}$&$\ldots cc$\\
&&&$5\ldots b\un{b}$&$\ldots ce$\\\hline
$15$&$3\ldots b\un{c}$&$\ldots ca$&$1\ldots c\un{c}$&$\ldots aa$\\
&&&$4\ldots c\un{a}$&$\ldots ab$\\
&&&$2\ldots c\un{e}$&$\ldots ac$\\
&&&$5\ldots c\un{b}$&$\ldots ae$\\\hline
$16$&$3\ldots e\un{c}$&$\ldots ca$&$1\ldots c\un{c}$&$\ldots aa$\\
&&&$4\ldots c\un{a}$&$\ldots ab$\\
&&&$2\ldots c\un{e}$&$\ldots ac$\\
&&&$5\ldots c\un{b}$&$\ldots ae$\\\hline
$17$&$3\ldots a\un{d}$&$\ldots ec$&$1\ldots d\un{c}$&$\ldots ca$\\
&&&$4\ldots d\un{a}$&$\ldots cb$\\
&&&$2\ldots d\un{e}$&$\ldots cc$\\
&&&$5\ldots d\un{b}$&$\ldots ce$\\\hline
$18$&$3\ldots b\un{d}$&$\ldots ec$&$1\ldots d\un{c}$&$\ldots ca$\\
&&&$4\ldots d\un{a}$&$\ldots cb$\\
&&&$2\ldots d\un{e}$&$\ldots cc$\\
&&&$5\ldots d\un{b}$&$\ldots ce$\\\hline
$19$&$3\ldots d\un{d}$&$\ldots ac$&$1\ldots d\un{c}$&$\ldots ca$\\
&&&$4\ldots d\un{a}$&$\ldots cb$\\
&&&$2\ldots d\un{e}$&$\ldots cc$\\
&&&$5\ldots d\un{b}$&$\ldots ce$\\\hline
$20$&$4\ldots b\un{a}$&$\ldots cb$&$5\ldots a\un{d}$&$\ldots ba$\\
&&&$2\ldots a\un{b}$&$\ldots bc$\\
&&&$3\ldots a\un{b}$&$\ldots bc$\\
&&&$1\ldots a\un{b}$&$\ldots bd$\\\hline
$21$&$4\ldots c\un{a}$&$\ldots ab$&$5\ldots a\un{d}$&$\ldots ba$\\
&&&$2\ldots a\un{b}$&$\ldots bc$\\
&&&$3\ldots a\un{b}$&$\ldots bc$\\
&&&$1\ldots a\un{b}$&$\ldots bd$\\\hline
$22$&$4\ldots d\un{a}$&$\ldots cb$&$5\ldots a\un{d}$&$\ldots ba$\\
&&&$2\ldots a\un{b}$&$\ldots bc$\\
&&&$3\ldots a\un{b}$&$\ldots bc$\\
&&&$1\ldots a\un{b}$&$\ldots bd$\\\hline
$23$&$4\ldots a\un{d}$&$\ldots ec$&$5\ldots d\un{d}$&$\ldots ca$\\
&&&$2\ldots d\un{b}$&$\ldots cc$\\
&&&$3\ldots d\un{b}$&$\ldots cc$\\
&&&$1\ldots d\un{b}$&$\ldots cd$\\\hline
$24$&$4\ldots b\un{d}$&$\ldots ec$&$5\ldots d\un{d}$&$\ldots ca$\\
&&&$2\ldots d\un{b}$&$\ldots cc$\\
&&&$3\ldots d\un{b}$&$\ldots cc$\\
&&&$1\ldots d\un{b}$&$\ldots cd$\\\hline
$25$&$4\ldots d\un{d}$&$\ldots ac$&$5\ldots d\un{d}$&$\ldots ca$\\
&&&$2\ldots d\un{b}$&$\ldots cc$\\
&&&$3\ldots d\un{b}$&$\ldots cc$\\
&&&$1\ldots d\un{b}$&$\ldots cd$\\\hline
$26$&$5\ldots b\un{a}$&$\ldots ce$&$3\ldots a\un{d}$&$\ldots ec$\\
&&&$4\ldots a\un{d}$&$\ldots ec$\\\hline
$27$&$5\ldots e\un{a}$&$\ldots ce$&$3\ldots a\un{d}$&$\ldots ec$\\
&&&$4\ldots a\un{d}$&$\ldots ec$\\\hline
$28$&$5\ldots b\un{b}$&$\ldots ce$&$3\ldots b\un{d}$&$\ldots ec$\\
&&&$4\ldots b\un{d}$&$\ldots ec$\\\hline
$29$&$5\ldots c\un{b}$&$\ldots ae$&$3\ldots b\un{d}$&$\ldots ec$\\
&&&$4\ldots b\un{d}$&$\ldots ec$\\\hline
$30$&$5\ldots d\un{b}$&$\ldots ce$&$3\ldots b\un{d}$&$\ldots ec$\\
&&&$4\ldots b\un{d}$&$\ldots ec$\\\hline
$31$&$5\ldots a\un{d}$&$\ldots ba$&$3\ldots d\un{d}$&$\ldots ac$\\
&&&$4\ldots d\un{d}$&$\ldots ac$\\\hline
$32$&$5\ldots d\un{d}$&$\ldots ca$&$3\ldots d\un{d}$&$\ldots ac$\\
&&&$4\ldots d\un{d}$&$\ldots ac$\\\hline
\end{longtable} 
In these results the ``smallest n" values were all 3.
The analysis of the possible states of the LHS's in the IRR($n$) and IRR($n+1$) shows that they are $\{2,3,4,5\}$ for each set number.

The analysis of the simultaneous induction defined by Table~\ref{irr4_relationships} proceeds in a similar way to that in Table~\ref{irr2_relationships} giving Table~\ref{irr3_relationships}. In the notation of Table~\ref{irr3_relationships} the following two results are obtained:
\begin{equation}\begin{array}{ccccc}
11(n=3)&16(n=3)&11\Leftrightarrow 16&11(n\ge 3)&16(n\ge 3)\\
13(n=3)&20(n=3)&13\Leftrightarrow 20&13(n\ge 3)&20(n\ge 3)\\
\end{array}\end{equation}
All the remaining results are of the form
$x(n=3)$ and $y(n)\Rightarrow x(n+1)$ (written as $y\Rightarrow x$ for brevity) implies $x(n\ge 3)$ where $y$ has already been proved for $n\ge 3$. To indicate them it is sufficient to write all the implication statements in the order that they are used (reading across then down).
\begin{equation}\begin{array}{cccc}
13\Rightarrow 10&10\Rightarrow 27&27\Rightarrow 17&17\Rightarrow 30\\
16\Rightarrow 29&20\Rightarrow 8&8\Rightarrow 15&15\Rightarrow 21\\
21\Rightarrow 31&31\Rightarrow 19&19\Rightarrow 12&19\Rightarrow 22\\
31\Rightarrow 25&25\Rightarrow 14&8\Rightarrow 26&26\Rightarrow 23\\
13\Rightarrow 28&28\Rightarrow 18&28\Rightarrow 24&24\Rightarrow 32\\
23\Rightarrow 9&8\Rightarrow 1&10\Rightarrow 2&22\Rightarrow 3\\
23\Rightarrow 4&13\Rightarrow 5&15\Rightarrow 6&17\Rightarrow7\\
\end{array}\end{equation}
The result of this is that each set is included for all $n\ge 3$.

******************

Hence the following addition to the inductive hypothesis (Table~\ref{irr8_relationships}) is suggested in analogy with Table~\ref{irr2_relationships} and Table~\ref{irr4_relationships}.
In Table~\ref{irr8_relationships} in the last column, the match to IRR($n+1$) is with the appropriate table i.e. Table~\ref{irr2_relationships} if the $\ldots$ is on the right, and Table~\ref{irr4_relationships} otherwise. As in Tables~\ref{irr2_relationships} and \ref{irr4_relationships}, the closure procedure was applied to ensure that all entries in column IRR($n+1$) also appear in column IRR($n$) and all other columns were completed. This only gave two extra rows indicated by the ``smallest n" values being 5.



% The process for deriving these can be illustrated by $3\un{a}ca\ldots\to cbd\ldots$. Adding $\alpha$ on the left gives the new origins $3\alpha\un{a}ca\ldots\left\{\begin{array}{l}\stackrel{\alpha=a}{\leftarrow}\left\{\begin{array}{l}5\un{c}aca\ldots\\5\un{e}aca\ldots\end{array}\right.\\\stackrel{\alpha=b}{\leftarrow}3\un{e}aca\ldots\\\stackrel{\alpha=c}{\leftarrow}4\un{c}aca\ldots\\\leftarrow2\alpha a\un{e}a\ldots\leftarrow 3\alpha ae\un{c}\ldots\end{array}\right.$ 
%corresponding to the derived IRR outlines
%$\left.\begin{array}{l}5\un{c}aca\ldots\\5\un{e}aca\ldots\end{array}\right\}\to acbd\ldots\\3\un{e}aca\ldots\to bcbd\ldots\\4\un{c}aca\ldots\to ccbd\ldots$ matching $16,21,25,27$. This leaves one backward search unfinished because the pointer ends next to $\ldots$ in one branch where a symbol was deleted. Going back to pick this up gives 
%$3\un{a}cad\ldots\to cbdb\ldots$ so $3\alpha\un{a}cad\leftarrow 3\alpha ae\un{c}d\ldots\leftarrow\emptyset$ showing that there are no other derived IRR outlines in this case. 
\begin{longtable}{c|c|ll|ll|l}
\caption{Further derived IRR outlines\label{irr8_relationships}}\\
set number&smallest $n$&\multicolumn{2}{c|}{IRR($n$)}&\multicolumn{2}{c}{IRR($n+1$)}&Matching IRR outlines \\
&&Origin&LHS&Origin&LHS&from Table~\ref{irr2_relationships} or \ref{irr4_relationships}\\\hline
$1$&4&$1\un{d}aa\ldots$&$bdb\ldots$&$2\un{d}da\ldots$&$abd\ldots$&$11$\\
&&&&$2\un{a}da\ldots$&$cbd\ldots$&$7$\\
&&&&$2\un{c}da\ldots$&$dbd\ldots$&$9$\\\hline
$2$&4&$1\un{d}ab\ldots$&$bdb\ldots$&$2\un{d}da\ldots$&$abd\ldots$&$11$\\
&&&&$2\un{a}da\ldots$&$cbd\ldots$&$7$\\
&&&&$2\un{c}da\ldots$&$dbd\ldots$&$9$\\\hline
$3$&4&$1\un{d}ca\ldots$&$bab\ldots$&$2\un{d}dc\ldots$&$aba\ldots$&$11$\\
&&&&$2\un{a}dc\ldots$&$cba\ldots$&$7$\\
&&&&$2\un{c}dc\ldots$&$dba\ldots$&$9$\\\hline
$4$&4&$1\un{e}aa\ldots$&$bdb\ldots$&$2\un{d}ea\ldots$&$abd\ldots$&$12$\\
&&&&$2\un{a}ea\ldots$&$cbd\ldots$&$8$\\
&&&&$2\un{c}ea\ldots$&$dbd\ldots$&$10$\\\hline
$5$&4&$1\un{e}ab\ldots$&$bdb\ldots$&$2\un{d}ea\ldots$&$abd\ldots$&$12$\\
&&&&$2\un{a}ea\ldots$&$cbd\ldots$&$8$\\
&&&&$2\un{c}ea\ldots$&$dbd\ldots$&$10$\\\hline
$6$&4&$1\un{e}ca\ldots$&$bab\ldots$&$2\un{d}ec\ldots$&$aba\ldots$&$12$\\
&&&&$2\un{a}ec\ldots$&$cba\ldots$&$8$\\
&&&&$2\un{c}ec\ldots$&$dba\ldots$&$10$\\\hline
$7$&4&$3\un{a}cb\ldots$&$cab\ldots$&$5\un{c}ac\ldots$&$aca\ldots$&$25$\\
&&&&$5\un{e}ac\ldots$&$aca\ldots$&$27$\\
&&&&$3\un{e}ac\ldots$&$bca\ldots$&$16$\\
&&&&$4\un{c}ac\ldots$&$cca\ldots$&$21$\\\hline
$8$&4&$3\un{a}cc\ldots$&$cab\ldots$&$5\un{c}ac\ldots$&$aca\ldots$&$25$\\
&&&&$5\un{e}ac\ldots$&$aca\ldots$&$27$\\
&&&&$3\un{e}ac\ldots$&$bca\ldots$&$16$\\
&&&&$4\un{c}ac\ldots$&$cca\ldots$&$21$\\\hline
$9$&4&$3\un{a}cd\ldots$&$cdb\ldots$&$5\un{c}ac\ldots$&$acd\ldots$&$25$\\
&&&&$5\un{e}ac\ldots$&$acd\ldots$&$27$\\
&&&&$3\un{e}ac\ldots$&$bcd\ldots$&$16$\\
&&&&$4\un{c}ac\ldots$&$ccd\ldots$&$21$\\
\hline
$10$&4&$3\un{a}eb\ldots$&$cca\ldots$&$5\un{c}ae\ldots$&$acc\ldots$&$25$\\
&&&&$5\un{e}ae\ldots$&$acc\ldots$&$27$\\
&&&&$3\un{e}ae\ldots$&$bcc\ldots$&$16$\\
&&&&$4\un{c}ae\ldots$&$ccc\ldots$&$21$\\
&&&&$4\un{b}eb\ldots$&$bcc\ldots$&\\
&&&&$3\un{a}eb\ldots$&$ccc\ldots$&\\
\hline
$11$&5&$3\un{a}eb\ldots$&$ccc\ldots$&$5\un{c}ae\ldots$&$acc\ldots$&$25$\\
&&&&$5\un{e}ae\ldots$&$acc\ldots$&$27$\\
&&&&$3\un{e}ae\ldots$&$bcc\ldots$&$16$\\
&&&&$4\un{c}ae\ldots$&$ccc\ldots$&$21$\\
&&&&$4\un{b}eb\ldots$&$bcc\ldots$&\\
&&&&$3\un{a}eb\ldots$&$ccc\ldots$&\\\hline
$12$&4&$3\un{e}ad\ldots$&$bdb\ldots$&$5\un{c}ea\ldots$&$abd\ldots$&$26$\\
&&&&$5\un{e}ea\ldots$&$abd\ldots$&$28$\\
&&&&$3\un{e}ea\ldots$&$bbd\ldots$&$17$\\
&&&&$4\un{c}ea\ldots$&$cbd\ldots$&$22$\\\hline
$13$&4&$4\un{b}cb\ldots$&$bab\ldots$&$4\un{b}bc\ldots$&$bba\ldots$&$18$\\
&&&&$3\un{a}bc\ldots$&$cba\ldots$&$13$\\
&&&&$2\un{d}db\ldots$&$aba\ldots$&$11$\\
&&&&$2\un{d}eb\ldots$&$aba\ldots$&$12$\\
&&&&$5\un{c}eb\ldots$&$aba\ldots$&$26$\\
&&&&$5\un{e}eb\ldots$&$aba\ldots$&$28$\\
&&&&$3\un{e}eb\ldots$&$bba\ldots$&$17$\\
&&&&$2\un{a}db\ldots$&$cba\ldots$&$7$\\
&&&&$2\un{a}eb\ldots$&$cba\ldots$&$8$\\
&&&&$4\un{c}eb\ldots$&$cba\ldots$&$22$\\
&&&&$2\un{c}db\ldots$&$dba\ldots$&$9$\\
&&&&$2\un{c}eb\ldots$&$dba\ldots$&$10$\\\hline
$14$&4&$4\un{b}cc\ldots$&$bab\ldots$&$4\un{b}bc\ldots$&$bba\ldots$&$18$\\
&&&&$3\un{a}bc\ldots$&$cba\ldots$&$13$\\
&&&&$2\un{d}db\ldots$&$aba\ldots$&$11$\\
&&&&$2\un{d}eb\ldots$&$aba\ldots$&$12$\\
&&&&$5\un{c}eb\ldots$&$aba\ldots$&$26$\\
&&&&$5\un{e}eb\ldots$&$aba\ldots$&$28$\\
&&&&$3\un{e}eb\ldots$&$bba\ldots$&$17$\\
&&&&$4\un{c}eb\ldots$&$cba\ldots$&$22$\\
&&&&$2\un{c}db\ldots$&$dba\ldots$&$9$\\
&&&&$2\un{c}eb\ldots$&$dba\ldots$&$10$\\\hline
$15$&4&$4\un{b}cd\ldots$&$bdb\ldots$&$4\un{b}bc\ldots$&$bbd\ldots$&$18$\\
&&&&$3\un{a}bc\ldots$&$cbd\ldots$&$13$\\
&&&&$2\un{d}db\ldots$&$abd\ldots$&$11$\\
&&&&$2\un{d}eb\ldots$&$abd\ldots$&$12$\\
&&&&$5\un{c}eb\ldots$&$abd\ldots$&$26$\\
&&&&$5\un{e}eb\ldots$&$abd\ldots$&$28$\\
&&&&$3\un{e}eb\ldots$&$bbd\ldots$&$17$\\
&&&&$2\un{a}db\ldots$&$cbd\ldots$&$7$\\
&&&&$2\un{a}eb\ldots$&$cbd\ldots$&$8$\\
&&&&$4\un{c}eb\ldots$&$cbd\ldots$&$22$\\
&&&&$2\un{c}db\ldots$&$dbd\ldots$&$9$\\
&&&&$2\un{c}eb\ldots$&$dbd\ldots$&$10$\\\hline
$16$&4&$4\un{b}eb\ldots$&$bca\ldots$&$4\un{b}be\ldots$&$bbc\ldots$&$18$\\
&&&&$3\un{a}be\ldots$&$cbc\ldots$&$13$\\\hline
$17$&5&$4\un{b}eb\ldots$&$bcc\ldots$&$4\un{b}be\ldots$&$bbc\ldots$&$18$\\
&&&&$3\un{a}be\ldots$&$cbc\ldots$&$13$\\\hline
$18$&4&$4\un{c}ad\ldots$&$cdb\ldots$&$4\un{b}ca\ldots$&$bcd\ldots$&$19$\\
&&&&$3\un{a}ca\ldots$&$ccd\ldots$&$14$\\\hline
$19$&4&$4\un{e}cc\ldots$&$adb\ldots$&$4\un{b}ec\ldots$&$bad\ldots$&$20$\\
&&&&$3\un{a}ec\ldots$&$cad\ldots$&$15$\\\hline
$20$&4&$4\un{e}ec\ldots$&$adb\ldots$&$4\un{b}ee\ldots$&$bad\ldots$&$20$\\
&&&&$3\un{a}ee\ldots$&$cad\ldots$&$15$\\\hline
$21$&4&$5\un{c}ad\ldots$&$adb\ldots$&$4\un{e}ca\ldots$&$aad\ldots$&$23$\\\hline
$22$&4&$5\un{e}ad\ldots$&$adb\ldots$&$4\un{e}ea\ldots$&$aad\ldots$&$24$\\\hline
$23$&4&$1\ldots ee\un{a}$&$\ldots cad$&$\emptyset$&&\\\hline
$24$&4&$3\ldots ee\un{c}$&$\ldots caa$&$1\ldots ec\un{c}$&$\ldots aaa$&$6$\\
&&&&$4\ldots ec\un{a}$&$\ldots aab$&$21$\\
&&&&$2\ldots ec\un{e}$&$\ldots aac$&$11$\\
&&&&$5\ldots ec\un{b}$&$\ldots aae$&$29$\\\hline
$25$&4&$3\ldots bd\un{d}$&$\ldots cbc$&$1\ldots dd\un{c}$&$\ldots bca$&$7$\\
&&&&$4\ldots dd\un{a}$&$\ldots bcb$&$22$\\
&&&&$2\ldots dd\un{e}$&$\ldots bcc$&$12$\\
&&&&$5\ldots dd\un{b}$&$\ldots bce$&$30$\\\hline
$26$&4&$4\ldots bd\un{d}$&$\ldots cbc$&$5\ldots dd\un{d}$&$\ldots bca$&$32$\\
&&&&$2\ldots dd\un{b}$&$\ldots bcc$&$9$\\
&&&&$3\ldots dd\un{b}$&$\ldots bcc$&$14$\\
&&&&$1\ldots dd\un{b}$&$\ldots bcd$&$4$\\\hline
$27$&4&$5\ldots ee\un{a}$&$\ldots cae$&$3\ldots ea\un{d}$&$\ldots aec$&$17$\\
&&&&$4\ldots ea\un{d}$&$\ldots aec$&$23$\\\hline
\end{longtable}
The induction cannot be carried out as before and is made unnecessary because in almost all cases, matches were obtained to for the IRR($n+1$) in previous tables. In this case the ``smallest $n$" values are actually the only $n$ values.
In the derivation of Table~\ref{irr8_relationships} on a few occasions, again the pointer went in the unexpected direction resulting in the following partial reverse rules and finally two members of IRR(5) of type RR. These are not extendable, so this argument ends here:
\begin{equation}4\alpha\un{b}cbe\dashleftarrow\left\{\begin{array}{l}4\un{b}bbae\\3\un{a}bbae\end{array}\right.\end{equation}
\begin{equation}4\alpha\un{b}cce\dashleftarrow5\alpha bbe\un{a}\end{equation}
\begin{equation}4\alpha\un{b}cde\dashleftarrow\emptyset\end{equation}
\begin{equation}3\alpha\un{a}cde\dashleftarrow\emptyset\end{equation}
\begin{equation}4\un{b}bbae\to2bbab\un{e}\to4bcaac\_\end{equation}
\begin{equation}3\un{a}bbae\to2cbab\un{e}\to1ababd\_\end{equation}

The result of this is the set of IRR outlines in Tables~\ref{irr2_relationships} \ref{irr4_relationships} and \ref{irr8_relationships} that together will match any IRR from the Turing machine.

\end{document}