Some more algorithms for Conway’s universal automaton
Boris Feliksovich Melnikov, Vasily Dolgov · Acta Universitatis Sapientiae Informatica · 2014
Abstract In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with Conway’s universal automaton. We give some algorithms of constructing this automaton and consider some examples.