A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata
暂无分享，去创建一个
[1] Sheila A. Greibach,et al. The Hardest Context-Free Language , 1973, SIAM J. Comput..
[2] Seymour Ginsburg,et al. On the existence of generators for certain AFL , 1970, Inf. Sci..