<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

Some more algorithms for Conway’s universal automaton

Acta Universitatis Sapientiae, Informatica

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.

{"article-title":"Some more algorithms for Conway\u2019s 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...

Some more algorithms for Conway’s universal automaton

Online veröffentlicht: 27. Juni 2014

Seitenbereich: 5 - 20

Eingereicht: 09. Juni 2013

DOI: https://doi.org/10.2478/ausi-2014-0015

Schlüsselwörter
nondeterministic finite automata, Conway’s universal automaton, constructing algorithms

© 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.

Some more algorithms for Conway’s universal automaton

Online veröffentlicht: 27. Juni 2014

Seitenbereich: 5 - 20

Eingereicht: 09. Juni 2013

DOI: https://doi.org/10.2478/ausi-2014-0015

Schlüsselwörternondeterministic finite automata, Conway’s universal automaton, constructing algorithms

© 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.

Schlüsselwörter
nondeterministic finite automata, Conway’s universal automaton, constructing algorithms