2 research outputs found
Exact Online String Matching Bibliography
In this short note we present a comprehensive bibliography for the online
exact string matching problem. The problem consists in finding all occurrences
of a given pattern in a text. It is an extensively studied problem in computer
science, mainly due to its direct applications to such diverse areas as text,
image and signal processing, speech analysis and recognition, data compression,
information retrieval, computational biology and chemistry. Since 1970 more
than 120 string matching algorithms have been proposed. In this note we present
a comprehensive list of (almost) all string matching algorithms. The list is
updated to May 2016.Comment: 23 page
On Learning Nominal Automata with Binders
We investigate a learning algorithm in the context of nominal automata, an
extension of classical automata to alphabets featuring names. This class of
automata captures nominal regular languages; analogously to the classical
language theory, nominal automata have been shown to characterise nominal
regular expressions with binders. These formalisms are amenable to abstract
modelling resource-aware computations. We propose a learning algorithm on
nominal regular languages with binders. Our algorithm generalises Angluin's L*
algorithm with respect to nominal regular languages with binders. We show the
correctness and study the theoretical complexity of our algorithm.Comment: In Proceedings ICE 2019, arXiv:1909.0524