We define the problem of machine improvisation of music with formal specifications. In this
problem, one seeks to create a random improvisation of a given reference melody that …

We formalize and analyze a new problem in formal language theory termed control
improvisation. Given a specification language, the problem is to produce an improviser, a …

We introduce the concept of control improvisation, the process of generating a random
sequence of control events guided by a reference sequence and satisfying a given speci …

The increasing use of autonomy for safety-critical tasks, from operating power grids to
driving cars, has led to an acute need for reliable and secure systems. The ideal approach to …

A new taxonomy of sublinear (multiple) keyword pattern matching algorithms is presented.
Based on an earlier taxonomy by the second and third authors, this new taxonomy includes …

We address the problem of mining musical specifications from a training set of songs and
using these specifications in a machine improvisation system capable of generating …

Sequence Analysis requires to elaborate data structures, which allow both an efficient
storage and use. A new one was introduced in 1999 by Cyril ALLAUZEN, Maxime …

The factor oracle is a relatively new data structure for the set of factors of a string. It has been
introduced by Allauzen, Crochemore, and Raffinot in 1999. It may recognize non-factors …

The authors consider the design and implementation of SPARE Time as an example of
taxonomy-based software construction (TABASCO). SPARE Time is a C++ toolkit for …

This paper presents a new taxonomy of sublinear (multiple) keyword pattern matching
algorithms. Based on an earlier taxonomy by Watson and Zwaan [WZ96, WZ95], this new …