Alfred V. Aho
- 1 AHO, A. V. Indexed grammars--an exerision of context-free grammars, d. ACM 15, 4 (Oct. 1968), 647-671. Google Scholar
- 2 Auo, A. V., IOPCROFT, J. E., AND ULLMAN, J.D. Time and tape complexity of pushdown automaton languages. Inform. Contr. I3, 3 (Sept. 1968), 186-206.Google Scholar
- 3 BAR-HILLEL, Y., PERLES, M., AND SItaMIa, E. On formal properties of simple phrase structure grammars. Z. Phonetik Sprachwissen. Kommunikationsforsch. 14 (1961), 143-172.Google Scholar
- 4 CHOMSKY, N. Context-free grammars and pushdown storage. Quart. Prog. Rep. 65, MITRes. Lab. Electron., MIT, Cambridge, Mass., 1962.Google Scholar
- 5 GINSBtmG, S. The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966. Google Scholar
- 6 GINSUURG, S., aND GImInaCH, S.A. Abstract families of languages. IEEE Conf. Record of Eighth Ann. Syrup. on Switching and Automata Theory, 1967, pp. 128-139.Google Scholar
- 7 GiNsnvt, S., GitmnhcH, S. A., aND HanmsoN, M.A. Stack automata and compiling. J. ACM 14, 1 (Jan. 1967), 172-201. Google Scholar
- 8 GINSnURo, S., GREHACH, S. A., AND HARmSON, M. A. One-way stack automata. J. ACM 14, 2 (Apr. 1967), 389-418. Google Scholar
- 9 GINSBURG, S., ANO HAImISON, M. A. One-way nondeterministic real-time list-storage languages. J. ACM 15, 3 (July 1968), 42&-446. Google Scholar
- 10 GINSBUIG, S., tND HOI'CROFT, J.E. Two-way balloon automata and AFL. Tech. Rep. No. 738/042/00, System Development Corp., Santa Monica, Calif.Google Scholar
- 11 GRAY, J. N., HamtiSON, M. A., aND IBamtA, O. Two-way pushdown automata. Inform. Contr. 11, 1/2 (July-Aug. 1967), 30-70.Google Scholar
- 12 GREIBACH, S. Checking automata and one-way stack language. IEEE Conf. Record of Ninth Ann. Syrup. on Switching and Automata Theory, 1968, pp. 287-291.Google Scholar
- 13 HOPCIOFT, J. E., AND ULLMAN, J.D. An approach to a unified theory of automata. Bell Syst. Tech. J 46 (1967), 1743-1829.Google Scholar
- 14 HOICROFT, J. E., ANn ULLMAN, J.D. Decidable and undecidable questions about automata. J. ACM 15, 2 (Apr. 1968), 317-324. Google Scholar
- 15 HOPCROFT, J. E., AND ULLMAN, J.D. Nonerasing stack automata. J. Compt. Syst. Sci. 1 (1967), 166-186.Google Scholar
- 16 HOPCROFT, J. E., AND ULLMAN, J.D. Sets accepted by one-way stack automata are context sensitive. Inform. Contr. 13, 2 (Aug. 1968), 114-133.Google Scholar
- 17 -IOPCROFT, J. E., AND ULLMAN, J. D. Deterministic stack automata and tile quotient operator. J. Comput. Syst. Sci. 2 (1968), 1-12.Google Scholar
- 18 HOPCROFT, J. E., AND ULLMaN, J.D. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969. Google Scholar
- 19 KNVTH, D. E., AND BIGELOW, R.H. Programming languages for automata. J. ACM 1, 4 (Oct. 1967), 615-635. Google Scholar
- 20 SCHKOTmCK, M. Two-type bracketed grammars. IEEE Conf. Record of Ninth Ann. Syrup. on Switching and Automata Theory, 1968, pp. 315-326.Google Scholar
Index Terms
-
Nested Stack Automata
-
Recommendations
-
Stack automata and compiling
Compilation consists of two parts, recognition and translation. A mathematical model is presented which embodies salient features of many modern compiling techniques. The model, called the stack automaton, has the desirable feature of being ...
-
Two-way nested stack automata are equivalent to two-way stack automata
The computing power of 2-way Nested Stack Automata is investigated. It is shownthat for any of the following types, a 2-way Nested Stack Automaton is equivalent to some 2-way Stack Automaton of the same type: Deterministic, Nondeterministic, k-head, L(n)...
-
Input-Driven stack automata
TCS'12: Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer ScienceWe introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely ...
Comments