Acerca de este artículo
Publicado en línea: 27 jun 2014
Páginas: 5 - 20
Recibido: 09 jun 2013
DOI: https://doi.org/10.2478/ausi-2014-0015
Palabras clave
© 2014
This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.