| Cole, Steven N. Pushdown store machines and real-time computation. In Proceedings of the [First Annual] ACM Symposium on Theory of Computing (1969) 233--245. |
....next lower element, down to the destination of a given pointer, or up to the top. Theorem 2 says that such a machine is universal, but we know that a stack automaton lacking pointers is not. This contrasts with the fact that pointers do not increase the power of a pushdown store machine (see Cole [5] and Hewitt [13] Acknowledgement We are grateful to Olivier Danvy for numerous technical suggestions that greatly improved the original exposition, and especially for the encouragement and assistance in making this work available in the published literature. We thank Carolyn Talcott for ....
Cole, Steven N. Pushdown store machines and real-time computation. In Proceedings of the [First Annual] ACM Symposium on Theory of Computing (1969) 233--245.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC