| Publication | Date of Publication | Type |
|---|
| Lexicographic transductions of finite words | 2026-08-05 | Paper |
| Register automata with permutations | 2026-08-05 | Paper |
| Church synthesis on register automata over linearly ordered data domains | 2026-04-21 | Paper |
| Synthesis from weighted specifications with partial domains over finite words | 2026-03-23 | Paper |
| The adversarial Stackelberg value in quantitative games | 2026-03-18 | Paper |
| Passive learning of regular data languages in polynomial time and data | 2026-02-10 | Paper |
LTL reactive synthesis with a few hints
Journal of Automated Reasoning | 2025-10-22 | Paper |
| Finite-valued streaming string transducers | 2025-06-18 | Paper |
Finite-valued streaming string transducers
TheoretiCS | 2025-03-06 | Paper |
| Deterministic regular functions of Infinite words | 2024-11-14 | Paper |
| A regular and complete notion of delay for streaming string transducers | 2024-10-08 | Paper |
| Two-player boundedness counter games | 2024-08-13 | Paper |
| A generic solution to register-bounded synthesis with an application to discrete orders | 2024-06-24 | Paper |
| LTL reactive synthesis with a few hints | 2024-04-05 | Paper |
Church synthesis on register automata over linearly ordered data domains
Formal Methods in System Design | 2024-03-11 | Paper |
Synthesizing Computable Functions from Rational Specifications Over Infinite Words
International Journal of Foundations of Computer Science | 2024-02-16 | Paper |
scientific article; zbMATH DE number 7799621 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
Two-Way Parikh Automata
(available as arXiv preprint) | 2023-02-03 | Paper |
| Synthesis of Data Word Transducers | 2023-02-03 | Paper |
| Computability of data-word transductions over different data domains | 2022-08-30 | Paper |
Computability of data-word transductions over different data domains
(available as arXiv preprint) | 2022-08-30 | Paper |
Synthesis of computable regular functions of infinite words
(available as arXiv preprint) | 2022-08-02 | Paper |
| Synthesis of computable regular functions of infinite words | 2022-08-02 | Paper |
| On canonical models for rational functions over infinite words | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559499 (Why is no real title available?) | 2022-07-18 | Paper |
Register Transducers Are Marble Transducers
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559473 (Why is no real title available?) | 2022-07-18 | Paper |
The complexity of transducer synthesis from multi-sequential specifications
(available as arXiv preprint) | 2021-08-04 | Paper |
| Expectations or guarantees? I want it all! A crossroad between games and MDPs | 2021-06-22 | Paper |
Expectations or guarantees? I want it all! A crossroad between games and MDPs
(available as arXiv preprint) | 2021-06-22 | Paper |
| Expressiveness of visibly pushdown transducers | 2021-06-17 | Paper |
Expressiveness of visibly pushdown transducers
(available as arXiv preprint) | 2021-06-17 | Paper |
Copyful streaming string transducers
Fundamenta Informaticae | 2021-05-21 | Paper |
A pattern logic for automata with outputs
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Synthesis of data word transducers
(available as arXiv preprint) | 2021-03-26 | Paper |
| Synthesis of data word transducers | 2021-03-26 | Paper |
Rational synthesis under imperfect information
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Logics for word transductions with synthesis
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| On delay and regret determinization of max-plus automata | 2021-01-19 | Paper |
On delay and regret determinization of max-plus automata
(available as arXiv preprint) | 2021-01-19 | Paper |
On computability of data word functions defined by transducers
(available as arXiv preprint) | 2020-09-23 | Paper |
| Two-way Parikh automata with a visibly pushdown stack | 2020-01-28 | Paper |
Logical and algebraic characterizations of rational transductions
(available as arXiv preprint) | 2020-01-03 | Paper |
Decidable weighted expressions with Presburger combinators
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Streamability of nested word transductions
(available as arXiv preprint) | 2019-05-17 | Paper |
A pattern logic for automata with outputs
(available as arXiv preprint) | 2018-11-22 | Paper |
Visibly pushdown transducers
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Decision problems of tree transducers with origin
Information and Computation | 2018-06-14 | Paper |
Multi-sequential word relations
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
Two-way visibly pushdown automata and transducers
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
First-order definability of rational transductions: an algebraic approach
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6862041 (Why is no real title available?) | 2018-04-19 | Paper |
| Copyful streaming string transducers | 2017-12-20 | Paper |
| The complexity of rational synthesis | 2017-12-19 | Paper |
On equivalence and uniformisation problems for finite transducers
(available as arXiv preprint) | 2017-12-19 | Paper |
Decidable weighted expressions with Presburger combinators
Lecture Notes in Computer Science | 2017-11-22 | Paper |
From two-way to one-way finite state transducers
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Regular transformations of infinite strings
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
Information and Computation | 2017-05-12 | Paper |
Doomsday equilibria for omega-regular games
Information and Computation | 2017-05-12 | Paper |
First-order definable string transformations
(available as arXiv preprint) | 2017-04-25 | Paper |
| Finite-valued weighted automata | 2017-04-25 | Paper |
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
(available as arXiv preprint) | 2017-03-03 | Paper |
Multi-sequential word relations
Developments in Language Theory | 2015-11-10 | Paper |
Decision problems of tree transducers with origin
Automata, Languages, and Programming | 2015-11-04 | Paper |
Quantitative languages defined by functional automata
Logical Methods in Computer Science | 2015-10-29 | Paper |
Doomsday equilibria for omega-regular games
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Logic-automata connections for transformations
Logic and Its Applications | 2015-01-09 | Paper |
Synthesis from LTL specifications with mean-payoff objectives
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design | 2012-09-27 | Paper |
Quantitative Languages Defined by Functional Automata
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Streamability of nested word transductions | 2012-08-31 | Paper |
Visibly pushdown transducers with look-ahead
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Compositional algorithms for LTL synthesis
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
Tree automata with global constraints
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Efficient enumeration for conjunctive queries over X-underbar structures
Computer Science Logic | 2010-09-03 | Paper |
Iterated regret minimization in game graphs
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Properties of visibly pushdown transducers
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
An Antichain Algorithm for LTL Realizability
Computer Aided Verification | 2009-06-30 | Paper |
Satisfiability of a Spatial Logic with Tree Variables
Computer Science Logic | 2009-03-05 | Paper |
Tree Automata with Global Constraints
Developments in Language Theory | 2008-10-30 | Paper |
