Author of the publication

On Computability of Data Word Functions Defined by Transducers.

, , and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 217-236. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Passive Learning of Regular Data Languages in Polynomial Time and Data., , and . CONCUR, volume 311 of LIPIcs, page 10:1-10:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Synthesizing Computable Functions from Rational Specifications Over Infinite Words., and . Int. J. Found. Comput. Sci., 35 (1&2): 179-214 (January 2024)Two-Way Parikh Automata., , and . FSTTCS, volume 150 of LIPIcs, page 40:1-40:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Synthesis from Weighted Specifications with Partial Domains over Finite Words., , and . FSTTCS, volume 182 of LIPIcs, page 46:1-46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Two-Player Boundedness Counter Games., and . CONCUR, volume 243 of LIPIcs, page 21:1-21:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Synthesis of Computable Regular Functions of Infinite Words., , , and . CONCUR, volume 171 of LIPIcs, page 43:1-43:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Two-Way Parikh Automata with a Visibly Pushdown Stack., , and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 189-206. Springer, (2019)Decidable weighted expressions with Presburger combinators., , and . J. Comput. Syst. Sci., (2019)On Canonical Models for Rational Functions over Infinite Words., , , and . FSTTCS, volume 122 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)LTL Reactive Synthesis with a Few Hints., , and . TACAS (2), volume 13994 of Lecture Notes in Computer Science, page 309-328. Springer, (2023)