| Publication | Date of Publication | Type |
|---|
Learning context-free grammars from positive data and membership queries
Logic, Language, Information, and Computation | 2024-02-28 | Paper |
Ogden's lemma, multiple context-free grammars, and the control language hierarchy
Information and Computation | 2019-12-18 | Paper |
On the recognizing power of the Lambek calculus with brackets
Journal of Logic, Language and Information | 2018-12-05 | Paper |
Distributional learning of some nonlinear tree grammars
Fundamenta Informaticae | 2017-07-28 | Paper |
The strong, weak, and very weak finite context and kernel properties
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Multidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars
Journal Of Logic And Computation | 2017-01-31 | Paper |
Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
Formal Grammar | 2016-12-01 | Paper |
Ogden's lemma, multiple context-free grammars, and the control language hierarchy
Language and Automata Theory and Applications | 2016-04-13 | Paper |
A note on intensionalization
Journal of Logic, Language and Information | 2015-02-09 | Paper |
The failure of the strong pumping lemma for multiple context-free languages
Theory of Computing Systems | 2015-02-05 | Paper |
A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
Formal Grammar | 2014-10-14 | Paper |
The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars
Formal Grammar | 2013-08-07 | Paper |
Abstract families of abstract categorial languages
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Distributional learning of abstract categorial grammars
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
Well-nestedness properly subsumes strict derivational minimalism
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
Second-order abstract categorial grammars as hyperedge replacement grammars
Journal of Logic, Language and Information | 2010-05-26 | Paper |
The copying power of well-nested multiple context-free grammars
Language and Automata Theory and Applications | 2010-05-26 | Paper |
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Developments in Language Theory | 2009-07-07 | Paper |
Computing interpolants in implicational logics
Annals of Pure and Applied Logic | 2006-09-14 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
| scientific article; zbMATH DE number 1233727 (Why is no real title available?) | 1998-12-17 | Paper |
Identification in the limit of categorial grammars
Journal of Logic, Language and Information | 1996-10-13 | Paper |
The Lambek calculus enriched with additional connectives
Journal of Logic, Language and Information | 1994-08-21 | Paper |
