论文信息 - Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages - 字舞流文

Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages

Catriel Beeri | Eli Shamir | E. Shamir | C. Beeri

[1] Harry B. Hunt,et al. On the time and tape complexity of languages I , 1973, STOC.

[2] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[3] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[4] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[6] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[7] Daniel J. Rosenkrantz,et al. Programmed Grammars and Classes of Formal Languages , 1969, JACM.