UM and three stack PDA.

Umar Waqar Anis; Malik Sikander Hayat Khiyal

Author(s)

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

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.

Publication Details

Page(s) 274-277

DOI DOI not available

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

Request the full text from PASTIC