( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learnability of Pregroup Grammars.

, , и . ICGI, том 3264 из Lecture Notes in Computer Science, стр. 65-76. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Nicolas Béchet

Tom Bechet

George Bechet

Jaap Denissen

Wladimir Denisow

 

Другие публикации лиц с тем же именем

Learnability of Pregroup Grammars., , и . Stud Logica, 87 (2-3): 225-252 (2007)Categorial grammars with iterated types form a strict hierarchy of k-valued languages., , и . Theor. Comput. Sci., (2012)k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures., и . WoLLIC, том 84 из Electronic Notes in Theoretical Computer Science, стр. 60-72. Elsevier, (2003)Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces.. IWPT, стр. 31-42. (2003)CDGFr, un corpus en dépendances non-projectives pour le français., и . TALN, стр. 206-212. ATALA, (2015)Dependency Structure Grammars., , и . LACL, том 3492 из Lecture Notes in Computer Science, стр. 18-34. Springer, (2005)System identification of photosensitiser uptake kinetics in photodynamic therapy., , , , и . Biomed. Signal Process. Control., 2 (3): 217-225 (2007)Biography of Alexandre Dikovsky., и . J. Log. Lang. Inf., 26 (4): 333-340 (2017)Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages.. ESOP, том 1058 из Lecture Notes in Computer Science, стр. 77-91. Springer, (1996)Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages., , и . CIAA, том 6807 из Lecture Notes in Computer Science, стр. 42-52. Springer, (2011)