Inferring descriptive generalisations of formal languages

Inferring Descriptive Generalisations of Formal Languages

In the present paper, we introduce a variant of Gold-style learners that is not required to infer precise descriptions of the languages in a class, but that must find descriptive patterns, i. e., optimal generalisations within a class of pattern languages. Our first main result characterises those indexed families of recursive languages that can be inferred by such learners, and we demonstrate ...

Inferring Deterministic Linear Languages

Linearity and determinism seem to be two essential conditions for polynomial language learning to be possible. We compare several definitions of deterministic linear grammars, and for a reasonable definition prove the existence of a canonical normal form. This enables us to obtain positive learning results in case of polynomial learning from a given set of both positive and negative examples. T...

Formal Languages

On inferring zero-reversible languages

We use a language-theoretic result for zero-reversible languages to show that there exists a linear time inference method for this class of languages using positive d a t a only.

Descriptive complexity for pictures languages

This paper deals with logical characterizations of picture languages of any dimension by syntactical fragments of existential second-order logic. Two classical classes of picture languages are studied: the class of recognizable picture languages, i.e. projections of languages defined by local constraints (or tilings): it is known as the most robust class extending the class of regular languages...