Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

The complexity of small universal Turing machines: A survey

Damien Woods and Turlough Neary
Theoretical Computer Science 410 (4-5) 443 (2009)
DOI: 10.1016/j.tcs.2008.09.051
See this article

Frontier between decidability and undecidability: a survey

Maurice Margenstern
Theoretical Computer Science 231 (2) 217 (2000)
DOI: 10.1016/S0304-3975(99)00102-4
See this article

Maurice Margenstern and Yurii Rogozhin
399 (2001)
DOI: 10.1007/978-94-015-9634-3_35
See this article

Maurice Margenstern
1234 226 (1997)
DOI: 10.1007/3-540-63045-7_23
See this article

Turlough Neary and Damien Woods
7147 385 (2012)
DOI: 10.1007/978-3-642-27660-6_32
See this article

Damien Woods and Turlough Neary
4497 791 (2007)
DOI: 10.1007/978-3-540-73001-9_84
See this article

ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON

MAURICE MARGENSTERN and LIOUDMILA PAVLOTSKAÏA
International Journal of Algebra and Computation 13 (02) 133 (2003)
DOI: 10.1142/S0218196703001262
See this article

Wang’s B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy

Turlough Neary, Damien Woods, Niall Murphy and Rainer Glaschick
Journal of Complexity 30 (5) 634 (2014)
DOI: 10.1016/j.jco.2014.02.003
See this article