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.

Saved in:
Bibliographic Details
Published inActa Universitatis Sapientiae. Informatica Vol. 6; no. 1; pp. 5 - 20
Main Authors Melnikov, Boris, Dolgov, Vasily
Format Journal Article
LanguageEnglish
Published Cluj-Napoca De Gruyter Open 01.06.2014
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects
constructing algorithms
Conway’s universal automaton
nondeterministic finite automata
Online AccessGet full text
ISSN2066-7760
1844-6086
2066-7760
DOI10.2478/ausi-2014-0015

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2066-7760
1844-6086
2066-7760
DOI:10.2478/ausi-2014-0015