The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved
RAIRO-Theor. Inf. Appl., 31 2 (1997) 159-204
Published online: 2017-02-01
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):
Automata, Universality, Computation
Turlough Neary and Damien WoodsEmergence, Complexity and Computation, Automata, Universality, Computation 12 117 (2015)
https://doi.org/10.1007/978-3-319-09039-9_5
Wang’s B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy
Turlough Neary, Damien Woods, Niall Murphy and Rainer GlaschickJournal of Complexity 30 (5) 634 (2014)
https://doi.org/10.1016/j.jco.2014.02.003
SOFSEM 2012: Theory and Practice of Computer Science
Turlough Neary and Damien WoodsLecture Notes in Computer Science, SOFSEM 2012: Theory and Practice of Computer Science 7147 385 (2012)
https://doi.org/10.1007/978-3-642-27660-6_32
The complexity of small universal Turing machines: A survey
Damien Woods and Turlough NearyTheoretical Computer Science 410 (4-5) 443 (2009)
https://doi.org/10.1016/j.tcs.2008.09.051
Computation and Logic in the Real World
Damien Woods and Turlough NearyLecture Notes in Computer Science, Computation and Logic in the Real World 4497 791 (2007)
https://doi.org/10.1007/978-3-540-73001-9_84
ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
MAURICE MARGENSTERN and LIOUDMILA PAVLOTSKAÏAInternational Journal of Algebra and Computation 13 (02) 133 (2003)
https://doi.org/10.1142/S0218196703001262
Where Mathematics, Computer Science, Linguistics and Biology Meet
Maurice Margenstern and Yurii RogozhinWhere Mathematics, Computer Science, Linguistics and Biology Meet 399 (2001)
https://doi.org/10.1007/978-94-015-9634-3_35
Frontier between decidability and undecidability: a survey
Maurice MargensternTheoretical Computer Science 231 (2) 217 (2000)
https://doi.org/10.1016/S0304-3975(99)00102-4
Logical Foundations of Computer Science
Maurice MargensternLecture Notes in Computer Science, Logical Foundations of Computer Science 1234 226 (1997)
https://doi.org/10.1007/3-540-63045-7_23