We study some combinatorial properties related to the problem of tablature for stringed instruments. First, we describe the problem in a formal way and prove that it is equivalent to a finite state automaton. We define the concepts of distance between two chords and tablature complexity in order to study the problem of tablature in terms of music performance. By using the Schutzenberger methodology we are then able to find the generating function counting the number of tablatures having a certain complexity and we can study the average complexity for the tablatures of a music score.
Tablatures for Stringed Instruments and Generating Functions / D. Baccherini;D. Merlini;R. Sprugnoli. - STAMPA. - (2007), pp. 40-52. [10.1007/978-3-540-72914-3_6]
Tablatures for Stringed Instruments and Generating Functions
MERLINI, DONATELLA;SPRUGNOLI, RENZO
2007
Abstract
We study some combinatorial properties related to the problem of tablature for stringed instruments. First, we describe the problem in a formal way and prove that it is equivalent to a finite state automaton. We define the concepts of distance between two chords and tablature complexity in order to study the problem of tablature in terms of music performance. By using the Schutzenberger methodology we are then able to find the generating function counting the number of tablatures having a certain complexity and we can study the average complexity for the tablatures of a music score.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.