Florent Jacquemard

Available identifiers

zbMath Open jacquemard.florentMaRDI QIDQ420847

List of research outcomes

Publication	Date of Publication	Type
Decidable approximations of term rewriting systems	2022-12-09	Paper
Symbolic weighted language models, quantitative parsing and automated music transcription	2022-08-16	Paper
Weighted automata computation of edit distances with consolidations and fragmentations	2022-01-06	Paper
A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring	2019-10-17	Paper
One-variable context-free hedge automata	2019-06-25	Paper
Pumping, cleaning and symbolic constraints solving	2019-04-29	Paper
\(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems	2016-04-28	Paper
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies	2015-12-02	Paper
A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting	2015-08-20	Paper
RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION	2015-04-29	Paper
Closure of Tree Automata Languages under Innermost Rewriting	2014-07-22	Paper
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories	2013-06-20	Paper
Rewrite Closure and CF Hedge Automata	2013-03-18	Paper
Sufficient completeness verification for conditional and constrained TRS	2012-05-23	Paper
Controlled Term Rewriting	2011-10-07	Paper
Rigid tree automata and applications	2011-07-27	Paper
Unique Normalization for Shallow TRS	2009-06-30	Paper
Reachability and confluence are undecidable for flat term rewriting systems	2009-04-28	Paper
Rigid Tree Automata	2009-04-02	Paper
Tree Automata with Equality Constraints Modulo Equational Theories	2009-03-12	Paper
The Confluence Problem for Flat TRSs	2009-01-15	Paper
Automated Induction with Constrained Tree Automata	2008-11-27	Paper
Closure of Hedge-Automata Languages by Hedge Rewriting	2008-08-28	Paper
Visibly Tree Automata with Memory and Constraints	2008-08-07	Paper
Tree automata with equality constraints modulo equational theories	2008-04-22	Paper
Tree Automata with Memory, Visibility and Structural Constraints	2007-09-07	Paper
Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks	2007-01-30	Paper
Ground reducibility is EXPTIME-complete	2004-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q2767013	2002-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q4942651	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4938629	2000-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4249176	2000-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q3838762	1998-08-13	Paper

Research outcomes over time

This page was built for person: Florent Jacquemard