4. LATA 2010:
: Three Learnable Models for the Description of Language.
Abdullah N. Arslan
: A Fast Longest Common Subsequence Algorithm for Similar Strings.
: Agreement and Cliticization in Italian: A Pregroup Analysis.
: Short Witnesses and Accepting Lassos in omega-Automata.
: The Inclusion Problem for Regular Expressions.
: Primitive Words Are Unavoidable for Context-Free Languages.
: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness.
, Sven Rahmann
: Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata.
: A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems.
: Using Sums-of-Products for Non-standard Reasoning.
: Some Minimality Results on Biresidual and Biseparable Automata.
: Complexity of Guided Insertion-Deletion in RNA-Editing.