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 Schützenberger 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Baccherini, D., Merlini, D., & Sprugnoli, R. (2007). Tablatures for stringed instruments and generating functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4475 LNCS, pp. 40–52). Springer Verlag. https://doi.org/10.1007/978-3-540-72914-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
