Author of the publication

One-way Definability of Sweeping Transducer.

, , , and . FSTTCS, volume 45 of LIPIcs, page 178-191. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)

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.

No persons found for author name Gauwin, Olivier
add a person with the name Gauwin, Olivier
 

Other publications of authors with the same name

Tree Automata.. Handbook of Finite State Based Models and Applications, Chapman and Hall/CRC, (2012)Right-Universality of Visibly Pushdown Automata., , and . RV, volume 8174 of Lecture Notes in Computer Science, page 76-93. Springer, (2013)On Canonical Models for Rational Functions over Infinite Words., , , and . FSTTCS, volume 122 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Aperiodicity of Rational Functions Is PSPACE-Complete., , and . FSTTCS, volume 65 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Streamability of Nested Word Transductions., , , and . FSTTCS, volume 13 of LIPIcs, page 312-324. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2011)An aperiodicity problem for multiwords., , , , and . RAIRO - Theor. Inf. and Applic., 46 (1): 33-50 (2012)Visibly pushdown automata on trees: universality and u-universality, , and . CoRR, (2012)Earliest Query Answering for Deterministic Nested Word Automata., , and . FCT, volume 5699 of Lecture Notes in Computer Science, page 121-132. Springer, (2009)One-way Definability of Sweeping Transducer., , , and . FSTTCS, volume 45 of LIPIcs, page 178-191. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)Efficient Enumeration for Conjunctive Queries over X-underbar Structures., , , and . CSL, volume 6247 of Lecture Notes in Computer Science, page 80-94. Springer, (2010)