A talk on the latest progress in ambiguity theory.

Ambiguity in Language and Logic, Studia Linguistica

Ambiguity, Trust and the Family (submitted)

Reasoning with Ambiguity, Journal of Logic, Language and Information.

Language-theoretic and Finite Relation Models for the (Full) Lambek Calculus. Journal of Logic, Language and Information.

The logic of ambiguity: The propositional case. Proceedings of Formal Grammar

(mit Timm Lichte) The proper treatment of linguistic ambiguity in ordinary algebra. Formal Grammar 2016. Corrected version (there was an important mistake in the published paper!)

Automatic Concepts and Automata-theoretic Semantics for the Full Lambek Calculus. LACL 2016.

Synchronous Subsequentiality and Approximations to Undecidable Problems. GandALF 2015: 58-72.

On some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results. Formal Grammar 2015.


The Cantor-Bendixson Analysis of Finite Trees. Formal Grammar 2014: 185-200.

Kleene Algebras, Regular Languages and Substructural Logics. GandALF 2014: 46-59.

(mit Younes Samih) Synchronous Regular Relations and Morphological Analysis. FSMNLP 2013: 35-38.


Completeness of Syntactic Concept Lattices for the Full Lambek Calculus. To appear in Proceedings of the 17th Conference on Formal Grammar. Syntactic concept lattices are algebraic structures which are defined by the distributional structure of languages. I show that this subclass of residuated lattices forms a complete class of models for the Full Lambek calculus.

The Lattice of Automata Classes: On Mild Extensions of Pushdown Automata. Appeared in: Proceedings of the 4th Workshop on Non-classical Methods in Automata Theory and Applications (NCMA).

Concepts and Types: An Application to Formal Language Theory. Appeared in: Proceedings of the 9th Conference on Concept Lattices and Applications.

Towards a Theory of Self-constructing Automata. Appeared in: Proceedings of the 11th Conference on Unconventional Computation and Natural Computation.

Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines. Appeared in: Proceedings of the 12th Conference on the Mathematics of Language.

Modularization of Regular Growth Automata. Appeared in: Proceedings of the 9th Workshop on FSMNLP.

(mit Maik St├╝hrenberg): Refining the Taxonomy of XML Schema Languages. A new Approach for Categorizing XML Schema Languages in Terms of Processing Complexity. Appeared in: Proceedings of Balisage: The Markup Conference, vol. 5.