Journal of the ACM (JACM)
Journal of the ACM (JACM)
Deterministic Pushdown Store Machines and Real-Time Computation
Journal of the ACM (JACM)
Intercalation theorems for stack languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Recognition of context-free and stack languages
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Deterministic stack automata and the quotient operator
Journal of Computer and System Sciences
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that for any SA there exists an equivalent semi-real-time Jump SA. Applying a well-known information theoretic argument to the Jump SA, we prove that certain languages cannot be SA languages. Parallel to Cole's treatment (J. Assoc. Comput. Mach. (1971), 306-328) of pushdown automata, we show that SA's can be reduced to real-time n-dimensional cellular automata.