Emmanuel Filiot

Sarah Winter

Int. J. Found. Comput. Sci., 2024

Finite-valued Streaming String Transducers.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Passive Learning of Regular Data Languages in Polynomial Time and Data.

[BibT_eX]

[DOI]

Mrudula Balachander

Proceedings of the 35th International Conference on Concurrency Theory, 2024

SynthLearn: A Tool for Guided Reactive Synthesis.

[BibT_eX]

[DOI]

Mrudula Balachander

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Regular Transformations (Dagstuhl Seminar 23202).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

LTL Reactive Synthesis with a Few Hints.

[BibT_eX]

[DOI]

Mrudula Balachander

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

A Regular and Complete Notion of Delay for Streaming String Transducers.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Deterministic Regular Functions of Infinite Words.

[BibT_eX]

[DOI]

Olivier Carton

Gaëtan Douéneau-Tabot

Sarah Winter

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Church synthesis on register automata over linearly ordered data domains.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., December, 2022

Computability of Data-Word Transductions over Different Data Domains.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Synthesis of Computable Regular Functions of Infinite Words.

[BibT_eX]

[DOI]

Vrunda Dave

Shankara Narayanan Krishna

Log. Methods Comput. Sci., 2022

A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Two-Player Boundedness Counter Games.

[BibT_eX]

[DOI]

Edwin Hamel-De le Court

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Alternating Tree Automata with Qualitative Semantics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

Synthesis of Data Word Transducers.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Copyful Streaming String Transducers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Transducer Synthesis from Universal Register Automata in (N, >).

[BibT_eX]

[DOI]

CoRR, 2021

2020

A Pattern Logic for Automata with Outputs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

[BibT_eX]

[DOI]

CoRR, 2020

[BibT_eX]

[DOI]

Gaëtan Douéneau-Tabot

Paul Gastin

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

The Adversarial Stackelberg Value in Quantitative Games.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Synthesis from Weighted Specifications with Partial Domains over Finite Words.

[BibT_eX]

[DOI]

Christof Löding

Sarah Winter

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

On Computability of Data Word Functions Defined by Transducers.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2020

Weighted Transducers for Robustness Verification.

[BibT_eX]

[DOI]

Sriram Sankaranarayanan

Ashutosh Trivedi

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Streamability of nested word transductions.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Logical and Algebraic Characterizations of Rational Transductions.

[BibT_eX]

[DOI]

Olivier Gauwin

Log. Methods Comput. Sci., 2019

Decidable weighted expressions with Presburger combinators.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Deciding the Computability of Regular Functions over Infinite Words.

[BibT_eX]

[DOI]

Vrunda Dave

Shankara Narayanan Krishna

CoRR, 2019

Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable.

[BibT_eX]

[DOI]

CoRR, 2019

Two-Way Parikh Automata.

[BibT_eX]

[DOI]

Shibashis Guha

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Two-Way Parikh Automata with a Visibly Pushdown Stack.

[BibT_eX]

[DOI]

Luc Dartois

Jean-Marc Talbot

Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018

Visibly pushdown transducers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Multi-Sequential Word Relations.

[BibT_eX]

[DOI]

Ismaël Jecker

Int. J. Found. Comput. Sci., 2018

Decision problems of tree transducers with origin.

[BibT_eX]

[DOI]

Inf. Comput., 2018

The Complexity of Transducer Synthesis from Multi-Sequential Specifications.

[BibT_eX]

[DOI]

Ismaël Jecker

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Rational Synthesis Under Imperfect Information.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Logics for Word Transductions with Synthesis.

[BibT_eX]

[DOI]

Luc Dartois

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On Canonical Models for Rational Functions over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Doomsday equilibria for omega-regular games.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Laurent Doyen

Inf. Comput., 2017

Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Formal Methods of Transformations (Dagstuhl Seminar 17142).

[BibT_eX]

[DOI]

Sebastian Maneth

Helmut Seidl

Dagstuhl Reports, 2017

Decidable Logics for Transductions and Data Words.

[BibT_eX]

[DOI]

Luc Dartois

CoRR, 2017

On delay and regret determinization of max-plus automata.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Transducers, logic and algebra for functions of finite words.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2016

First-order definability of rational transductions: An algebraic approach.

[BibT_eX]

[DOI]

Olivier Gauwin

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Two-Way Visibly Pushdown Automata and Transducers.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On Equivalence and Uniformisation Problems for Finite Transducers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Complexity of Rational Synthesis.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Aperiodicity of Rational Functions Is PSPACE-Complete.

[BibT_eX]

[DOI]

Olivier Gauwin

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Quantitative Languages Defined by Functional Automata

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Logic-Automata Connections for Transformations.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications - 6th Indian Conference, 2015

2014

On Streaming String Transducers and HDT0L Systems.

[BibT_eX]

[DOI]

CoRR, 2014

Expectations or Guarantees? I Want It All! A crossroad between games and MDPs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

First-order Definable String Transformations.

[BibT_eX]

[DOI]

Shankara Narayanan Krishna

Ashutosh Trivedi

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Finite-Valued Weighted Automata.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Safraless Synthesis for Epistemic Temporal Specifications.

[BibT_eX]

[DOI]

Rodica Bozianu

Catalin Dima

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013

Exploiting structure in LTL synthesis.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2013

Expressiveness of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

Synthesis from LTL Specifications with Mean-Payoff Objectives.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

From Two-Way to One-Way Finite State Transducers.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

Visibly Pushdown Transducers with Look-Ahead.

[BibT_eX]

[DOI]

Frédéric Servais

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Regular Transformations of Infinite Strings.

[BibT_eX]

[DOI]

Rajeev Alur

Ashutosh Trivedi

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Acacia+, a Tool for LTL Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

Antichains and compositional algorithms for LTL synthesis.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2011

2010

Tree Automata with Global Constraints.

[BibT_eX]

[DOI]

Jean-Marc Talbot

Sophie Tison

Int. J. Found. Comput. Sci., 2010

On Functionality of Visibly Pushdown Transducers

[BibT_eX]

[DOI]

CoRR, 2010

Properties of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Iterated Regret Minimization in Game Graphs.

[BibT_eX]

[DOI]

Tristan Le Gall

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Efficient Enumeration for Conjunctive Queries over X-underbar Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Compositional Algorithms for LTL Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2010

2009

An Antichain Algorithm for LTL Realizability.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008

Logics for n-ary queries in trees.

[BibT_eX]

[DOI]

PhD thesis, 2008

Regular n-ary Queries in Trees and Variable Independence.

[BibT_eX]

[DOI]

Sophie Tison

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

Polynomial time fragments of XPath with variables.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Satisfiability of a Spatial Logic with Tree Variables.

[BibT_eX]

[DOI]