UM and three stack PDA. | [Information technology Journal • 2005]

Author(s):

1. Umar Waqar Anis: Department of Computer Science, Faculty of Applied Sciences, International Islamic University, Islamabad, Pakistan

2. Malik Sikander Hayat Khiyal: Department of Computer Science, Faculty of Applied Sciences, International Islamic University, Islamabad, Pakistan

Abstract:

This study gives an overview of Minsky theorem and then defines two machines. One with one stack and a moving head tape (UM). The second is a pushdown automation with three stacks (3SPDA). Then we compare these new machines with a Turing Machine TM.

Page(s): 274-277

DOI: DOI not available

Published: Journal: Information technology Journal, Volume: 4, Issue: 3, Year: 2005

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views