Jean-Marc Talbot

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

12h-index412citations50works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Logic, programming, and type systems(26), Formal Methods in Verification(25), semigroups and automata theory(21), Logic, Reasoning, and Knowledge(8), Natural Language Processing Techniques(5)

Publications50 total

Regular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi mathvariant="script">D</mml:mi></mml:math>-length: A tool for improved prefix-stable forward Ramsey factorisations
Information Processing Letters·2024Open Access
Solving Access Control Conflicts in Multi-User Systems
2024Open Access
Weighted Automata and Expressions over Pre-Rational Monoids
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
IL-6 levels are dramatically high in the sputum from children with sickle cell disease during acute chest syndrome
Blood Advances·2020· 19 citedOpen Access
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019Open Access
Two-Way Parikh Automata with a Visibly Pushdown Stack
Lecture notes in computer science·2019· 1 citedOpen Access
Visibly pushdown transducers
Journal of Computer and System Sciences·2018· 11 citedOpen Access
Decision problems of tree transducers with origin
Information and Computation·2018· 8 citedOpen Access
Analysis of access control policy updates through narrowing
2016· 1 cited
A Generalised Twinning Property for Minimisation of Cost Register Automata
2016· 19 cited
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2016Open Access
25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016, August 29 - September 1, 2016, Marseille, France
HAL (Le Centre pour la Communication Scientifique Directe)·2016· 2 cited
Trimming visibly pushdown automata
Theoretical Computer Science·2015· 3 cited
Decision Problems of Tree Transducers with Origin
Lecture notes in computer science·2015· 5 citedOpen Access
Expressiveness of Visibly Pushdown Transducers
Electronic Proceedings in Theoretical Computer Science·2013· 3 citedOpen Access
Trimming Visibly Pushdown Automata
Lecture notes in computer science·2013· 3 cited
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
Lecture notes in computer science·2012· 7 cited
A polynomial procedure for trimming visibly pushdown automata
HAL (Le Centre pour la Communication Scientifique Directe)·2011· 3 citedOpen Access
An Accurate Type System for Information Flow in Presence of Arrays
Lecture notes in computer science·2011Open Access
TREE AUTOMATA WITH GLOBAL CONSTRAINTS
International Journal of Foundations of Computer Science·2010· 17 cited
page 1 of 3Next →

Frequent Co-authors

Emmanuel Filiot(13), Pierre-Alain Reynier(12), Sophie Tison(11), Witold Charatonik(6), Mathieu Caralp(5), Frédéric Servais(4), Iovka Boneva(4), Andrew D. Gordon(3), Jean-François Raskin(3), Philippe Devienne(3), Benjamin Monmege(3), Silvano Dal Zilio(2), Supratik Mukhopadhyay(2), Sebastian Maneth(2), Joachim Niehren(2), Dorina Ghindici(2), Isabelle Simplot-Ryl(2), Laurent Régnier(2), Clara Bertolissi(2), Théodore Lopez(2)