Have a personal or library account? Click to login
Some more algorithms for Conway’s universal automaton Cover

Some more algorithms for Conway’s universal automaton

Acta Universitatis Sapientiae, Informatica
Volume 6 (2014): Issue 1 (June 2014)
By: Boris Melnikov and  Vasily Dolgov  
Open Access
|Jun 2014

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/ausi-2014-0015 | Journal eISSN: 2066-7760
Journal RSS Feed
Language: English
Page range: 5 - 20
Submitted on: Jun 9, 2013
|
Published on: Jun 27, 2014
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
nondeterministic finite automata,
Conway’s universal automaton,
constructing algorithms
Related subjects:
Computer sciences,
Computer sciences, other

© 2014 Boris Melnikov, Vasily Dolgov, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 6 (2014): Issue 1 (June 2014)Next article