| Publication | Date of Publication | Type |
|---|
Biography of Alexandre Dikovsky
Journal of Logic, Language and Information | 2018-01-12 | Paper |
A complete axiomatisation for the inclusion of series-parallel partial orders
Rewriting Techniques and Applications | 2017-11-17 | Paper |
Categorial dependency grammars with iterated sequences
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) | 2017-02-22 | Paper |
| CDG Lab: an Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development | 2015-06-22 | Paper |
NP-completeness of grammars based upon products of free pregroups
Lecture Notes in Computer Science | 2014-05-08 | Paper |
Universal Boolean systems
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Hard combinators
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
\(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
Two models of learning iterated dependencies
Formal Grammar | 2012-11-02 | Paper |
Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
Theoretical Computer Science | 2012-08-09 | Paper |
Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
Implementation and Application of Automata | 2011-07-29 | Paper |
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
Fully Lexicalized Pregroup Grammars
Logic, Language, Information and Computation | 2009-03-10 | Paper |
Optional and Iterated Types for Pregroup Grammars
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Parsing pregroup grammars and Lambek calculus using partial composition
Studia Logica | 2008-01-21 | Paper |
Learnability of pregroup grammars
Studia Logica | 2008-01-21 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Theoretical Computer Science | 2006-04-28 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
| scientific article; zbMATH DE number 1722695 (Why is no real title available?) | 2002-03-21 | Paper |
Minimality of the correctness criterion for multiplicative proof nets
Mathematical Structures in Computer Science | 1999-03-22 | Paper |
| scientific article; zbMATH DE number 1104363 (Why is no real title available?) | 1998-01-14 | Paper |
