Skip Navigation


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
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rovan, B.
Right arrow Articles by Steskal, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

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 {Delta}3 Reconsidered

Branislav Rovan and L'uboS 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.

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).



References

  1. Rovan Branislav, Steskal L'uboS. Infinite computations and a hierarchy in {Delta}3. In: CiE. Vol. 4497 of Lecture Notes in Computer Science.—Barry Cooper S, Löwe Benedikt, Sorbi Andrea, eds. (2007) Berlin, Heidelberg: Springer. 660–669.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rovan, B.
Right arrow Articles by Steskal, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?