Some more algorithms for Conway’s universal automaton

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.

Bibliographic Details
Main Authors: Melnikov Boris, Dolgov Vasily
Format: Article
Language:English
Published: Sciendo 2014-06-01
Series:Acta Universitatis Sapientiae: Informatica
Subjects:
Online Access:https://doi.org/10.2478/ausi-2014-0015