On multiply-exponential write-once Turing machines
Computational Complexity
2014-10-30 v2 Formal Languages and Automata Theory
Abstract
In this work we analyze the multiply-exponential complexity classes for write-once Turing machines, i.e. machines that can write to a given tape cell at most once. We show that -DExpWOSpace = -DExpWOTime = -ExpTime and the nondeterministic counterpart. For alternating machines we show that -AExpWOTime = -AExpTime = -ExpSpace.
Cite
@article{arxiv.1407.7592,
title = {On multiply-exponential write-once Turing machines},
author = {Maciej Zielenkiewicz and Aleksy Schubert and Jacek Chrząszcz},
journal= {arXiv preprint arXiv:1407.7592},
year = {2014}
}