Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages

Tomoyuki Yamakami. Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. In Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa, editors, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, NovĂ˝ Smokovec, Slovakia, January 26-29, 2014, Proceedings. Volume 8327 of Lecture Notes in Computer Science, pages 514-525, Springer, 2014. [doi]

Authors

Tomoyuki Yamakami

This author has not been identified. Look up 'Tomoyuki Yamakami' in Google