One-way stack automata
- 1 April 1967
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 14 (2) , 389-418
- https://doi.org/10.1145/321386.321403
Abstract
A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequential transduction preserves the former; set complementation, the latter. Several solvability questions are also considered.Keywords
This publication has 3 references indexed in Scilit:
- Stack automata and compilingJournal of the ACM, 1967
- On certain formal properties of grammarsInformation and Control, 1959
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959