ON SOME PROPERTIES OF LENGTH-GROWING FUNCTIONS ON TWO-WAY PUSHDOWN AUTOMATA-Reference-Cited by-同舟云学术

ON SOME PROPERTIES OF LENGTH-GROWING FUNCTIONS ON TWO-WAY PUSHDOWN AUTOMATA

Published:1968 Issue:2 Volume:22 Page:110-127
ISSN:1883-2172
Container-title:Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
language:en
Short-container-title:Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics

Author:

ARIKAWA Setsuo

Publisher

Faculty of Mathematics, Kyushu University

Subject

General Earth and Planetary Sciences,General Environmental Science

Link

https://www.jstage.jst.go.jp/article/kyushumfs/22/2/22_2_110/_pdf

Reference4 articles.

1. [1] P. M. LEWIS II, R. E. STEARNS, and J. HARTMANIS, Memory bounds for recognition of context-free and context-sensitive languages. Proceedings of the 1965 Conference on Switching Circuit Theory and Logical Design, Institute of Electrical and Electronics Engineers, New York, (1965), 191-202.

2. Two-way pushdown automata

3. [3] S. GINSBURG, The mathematical theory of context free languages McGraw Hill, New York, 1966.

4. [4] N. CHOMSKY, Formal Properties of grammars, Chap. 12 of Handbook of mathematical psychology, vol. II. Edited by Luce, R. D. and others. John Wiley and Sons, Inc., 1963.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS;Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics;1970

2. ON THE LENGTH FUNCTIONS OF LANGUAGES RECOGNIZABLE BY LINEAR BOUNDED AUTOMATA;Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics;1969