The field of grammatical inference (also known as grammar induction) is transversal to a
number of research areas including machine learning, formal language theory, syntactic and …

Probabilistic finite-state machines are used today in a variety of areas in pattern recognition
or in fields to which pattern recognition is linked. In part I of this paper, we surveyed these …

Analogs of balls in n-dimensional Euclidean space are defined in the monoid of strings
composed of letters of an alphabet if a metric is defined on the monoid. These analogs are …

Abstract The use of Real Time Location Systems in combination with Process Mining
solutions can produce precise and unobtrusive methods for discovering and analyzing …

When facing the question of learning languages in realistic settings, one has to tackle
several problems that do not admit simple solutions. On the one hand, languages are …

In formal language theory, finite-state transducers are well-know models for simple “input-
output” map**s between two languages. Even if more powerful, recursive models can be …

In this work, we introduce DeepDFA, a novel approach to identifying Deterministic Finite
Automata (DFAs) from traces, harnessing a differentiable yet discrete model. Inspired by …

Abstract Language models are used in a variety of fields in order to support other tasks:
classification, next-symbol prediction, pattern analysis. In order to compare language …

During the 80's, Angluin introduced an active learning paradigm, using an Oracle, capable
of answering both membership and equivalence queries. However, practical evidence tends …

In formal language theory finite-state transducers are well-know models for “input-output”
rational map**s between two languages. Even if more powerful, recursive models can be …