Journal of Logic and Computation Advance Access originally published online on August 22, 2008
Journal of Logic and Computation 2009 19(1):175-176; doi:10.1093/logcom/exn022
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
This article appears in the following Journal of Logic and Computation issue: Special Issue: Logic and Computation in the Real World: CiE 2007 [View the issue table of contents]
Original Articles |
Infinite Computations and a Hierarchy in
3 Reconsidered
Steskal
Department of Computer Science, Faculty of Mathematics Physics and Informatics, Comenius University, 84248 Bratislava, Slovakia
E-mail: steskal{at}dcs.fmph.uniba.sk; rovan{at}dcs.fmph.uniba.sk
Received 1 October 2007.
| Abstract |
|---|
In this note, we reconsider the results in Rovan and Steskal (2007, Vol. 4497 of Lecture Notes in Computer Science, pp. 660–669, Springer) concerning TMDC (Display Turing Machines with Control) with Chomsky like control language. We shall show that, under the given assumptions, various degrees of the control complexity do not give rise to a hierarchy of language families, thus correcting an error in Rovan and Steskal (2007, Vol. 4497 of Lecture Notes in Computer Science, pp. 660–669, Springer).