Constrained Markov Sequence Generation

This book deals with the problem of generating sequences in the style of a given corpus, in text or music. In particular, the authors study Markov models, which have long been used for capturing basic statistical information about how elements of a given alphabet are put together in representative sequences, formulating them as constraint satisfaction problems (CSPs), a formulation which opens the door to many extensions of basic Markov models through the modularity of constraint satisfaction.

The book will be valuable to practitioners, researchers, and graduate students engaged with algorithmic composition and constraint satisfaction.

Aceasta carte trateaza problema generarii secventelor in stilul unui corpus dat, in text sau muzica. In special, autorii studiaza modelele Markov, care au fost folosite de mult timp pentru a capta informatii statistice de baza despre modul in care elementele unui anumit alfabet sunt reunite in secvente reprezentative, formulandu-le ca probleme de satisfactie a constrangerii (CSP), o formulare care deschide usa catre multe extensii ale modelelor Markov de baza prin modularitatea satisfactiei prin constrangere. Cartea va fi valoroasa pentru practicieni, cercetatori si studenti absolventi implicati in compozitia algoritmica si satisfactia constrangerilor.