NP-Completeness of Grammars Based Upon Products of Free Pregroups

Denis Béchet. NP-Completeness of Grammars Based Upon Products of Free Pregroups. In Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott, editors, Categories and Types in Logic, Language, and Physics - Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday. Volume 8222 of Lecture Notes in Computer Science, pages 51-62, Springer, 2014. [doi]

@inproceedings{Bechet14,
  title = {NP-Completeness of Grammars Based Upon Products of Free Pregroups},
  author = {Denis Béchet},
  year = {2014},
  doi = {10.1007/978-3-642-54789-8_4},
  url = {http://dx.doi.org/10.1007/978-3-642-54789-8_4},
  researchr = {https://researchr.org/publication/Bechet14},
  cites = {0},
  citedby = {0},
  pages = {51-62},
  booktitle = {Categories and Types in Logic, Language, and Physics - Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday},
  editor = {Claudia Casadio and Bob Coecke and Michael Moortgat and Philip Scott},
  volume = {8222},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-54788-1},
}