Lambek Grammars with One Division Are Decidable in Polynomial Time

Yury Savateev. Lambek Grammars with One Division Are Decidable in Polynomial Time. In Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko, editors, Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Volume 5010 of Lecture Notes in Computer Science, pages 273-282, Springer, 2008. [doi]

Abstract

Abstract is missing.