Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Jacquemard, Florent"'
We revisit the problems of pitch spelling and tonality guessing with a new algorithm for their joint estimation from a MIDI file including information about the measure boundaries. Our algorithm does not only identify a global key but also local ones
Externí odkaz:
http://arxiv.org/abs/2402.10247
Autor:
Karystinaios, Emmanouil, Foscarin, Francesco, Jacquemard, Florent, Sakai, Masahiko, Tojo, Satoshi, Widmer, Gerhard
This paper focuses on the nominal durations of musical events (notes and rests) in a symbolic musical score, and on how to conveniently handle these in computer applications. We propose the usage of a temporal unit that is directly related to the gra
Externí odkaz:
http://arxiv.org/abs/2310.14952
Autor:
Giraud, Mathieu, Jacquemard, Florent
Publikováno v:
In Information and Computation January 2022 282
Publikováno v:
Logical Methods in Computer Science, Volume 12, Issue 2 (April 26, 2016) lmcs:1635
A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(<,+1,~) over data trees. Here +1 refers to the child and the next
Externí odkaz:
http://arxiv.org/abs/1601.01579
Autor:
Jacquemard, Florent
Ce document présente l'étude de plusieurs modèles de machines à états finis qui étendent tous le même formalisme: les automates d'arbres classiques, et leur application dans différentes tâches telles que l'analyse statique de programmes ou d
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00643595
http://tel.archives-ouvertes.fr/docs/00/64/35/95/PDF/plan.pdf
http://tel.archives-ouvertes.fr/docs/00/64/35/95/PDF/plan.pdf
We describe an intermediate language designed as a medium-level internal representation of programs of the interactive music system Antescofo. This representation is independent both of the Antescofo source language and of the architecture of the exe
Externí odkaz:
http://arxiv.org/abs/1404.7335
Publikováno v:
Logical Methods in Computer Science, Volume 9, Issue 2 (April 2, 2013) lmcs:1161
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for e
Externí odkaz:
http://arxiv.org/abs/1302.6960
Publikováno v:
7th International Conference on Language and Automata Theory and Application (2013)
We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules. We also extend the param
Externí odkaz:
http://arxiv.org/abs/1212.5108
We consider problems of access control for update of XML documents. In the context of XML programming, types can be viewed as hedge automata, and static type checking amounts to verify that a program always converts valid source documents into also v
Externí odkaz:
http://arxiv.org/abs/0907.5125
Autor:
Bouhoula, Adel, Jacquemard, Florent
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values), and may ex
Externí odkaz:
http://arxiv.org/abs/0811.4720