Florent Jacquemard |  Michael Rusinowitch -  《Language and auvtomata theory and applications :》 -  International Conference on Languauge and Automata Theory and Applications - 2013, - 371～382 - 共12页

摘要：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 wi...

关键词： Rewrite;;class;;introduce

NSTL主题词： hedges |  Automata |  CONTAINMENT FAILURE |  surgical closure

Jose Echeveste |  Arshia Cont... -  《Journal Europeen des Systemes Automatises》 - 2011,45(1/3) - 109～124 - 共16页

摘要：Nous presentons les problematiques temps reel de l'accompagnement musical automatique vu comme un systeme reactif. Nous introduisons un modele de datation prenant en compte les differentes echelles de...

关键词： Informatique musicale |  Suivi de partition |  Accompagnement automatique |  Programmation synchrone |  Langage synchrone |  Rattrapage d'erreurs

Luis Barguno |  Caries Creus... -  《2010 25th Annual IEEE Symposium on Logic in Computer Science》 -  Annual IEEE Symposium on Logic in Computer Science (LICS 2010) - 2010, - 263～272 - 共10页

摘要：We define tree automata with global constraints (TAGC), generalizing the class of tree automata with global equality and disequality constraints [1] (TAGED). TAGC can test for equality and disequality...

关键词： Emptiness;;Automata;;Constraints

NSTL主题词： Automata |  Trees |  Constraint

STEPHANIE DELAUNE |  FLORENT JACQUEMARD -  《Journal of automated reasoning》 - 2006,36(1/2) - 85～124 - 共40页

摘要：We consider the problem of formal automatic verification of cryptographic protocols when some data, like poorly chosen passwords, can be guessed by dictionary attacks. First, we define a theory of the...

关键词： verification |  cryptographic protocols |  formal methods |  dictionary attacks |  probabilistic encryption

Ichiro Mitsuhashi |  Michio Oyamaguch... -  《8th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2006)》 -  8th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2006) - 2006, - 68～81 - 共14页

摘要：We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each rewrite rule are at ...

关键词： Term rewriting system |  Decision problem |  Confluence |  Flat

Stephanie Delaune |  Florent Jacquemard -  《11th ACM Conference on Computer and Communications Security (CCS 2004)》 -  11th ACM Conference on Computer and Communications Security (CCS 2004) - 2004, - 278～287 - 共10页

摘要：We present a non-deterministic polynomial time procedure to decide the problem of insecurity, in the presence of a bounded number of sessions, for cryptographic protocols containing explicit destructo...

关键词： Security Protocols |  Formal Methods |  Constraint

Florent Jacquemard -  《Information processing letters》 - 2003,87(5) - 265～270 - 共6页

摘要：Ground reachability, ground joinability and confluence are shown undecidable for flat term rewriting systems, i.e., systems in which all left and right members of rule have depth at most one.

关键词： theory of computation |  term rewriting

Hubert Comon |  Florent Jacquemard -  《Information & Computation》 - 2003,187(1) - 123～153 - 共31页

摘要：We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognisable tree languages. It is more ...

关键词： computer theorem-proving |  rewriting systems |  tree automata |  computational complexity

Francesco Foscarin |  Florent Jacquemard... -  《Mathematics and computation in music: 7th international conference on mathematics and computation in music (MCM 2019), June 18–21, 2019, Madrid, Spain》 -  International conference on mathematics and computation in music - 2019, - 248～260 - 共13页

摘要：We present a formal language-based framework for MIDI-to-score transcription, the problem of converting a sequence of symbolic musical events with arbitrary timestamps into a structured music score. T...

NSTL主题词： Rhythms |  Quantization |  Frameworks

Florent Jacquemard |  Yoshiharu Kojima... -  《Automated deduction: CADE-25, 25th International Confernece on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings》 -  International Confernece on Automated Deduction - 2015, - 137～151 - 共15页

摘要：We consider an extension of term rewriting rules with context constraints restricting the application of rewriting to positions whose prefix (i.e. the sequence of symbols from the rewrite position up ...

NSTL主题词： bottom-up