, Streaming transducers for algorithmic verification of singlepass list-processing programs, POPL, pp.599-610, 2011.
DOI : 10.1145/1925844.1926454
URL : http://www.ist.ac.at/%7Ecernyp/publications/popl11/popl11.pdf
, Expressiveness of streaming string transducers, FSTTCS, pp.1-12, 2010.
DOI : 10.1007/978-3-642-20920-8_1
, Streaming tree transducers. CoRR, abs, 1104.
DOI : 10.1007/978-3-642-31585-5_8
URL : http://www.cis.upenn.edu/%7Elorisdan/images/stt12.pdf
, Streaming tree transducers, LNCS, vol.7392, issue.2, pp.42-53, 2012.
DOI : 10.1007/978-3-642-31585-5_8
URL : http://www.cis.upenn.edu/%7Elorisdan/images/stt12.pdf
, Regular Functions and Cost Register Automata, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.13-22, 2013.
DOI : 10.1109/LICS.2013.65
URL : http://www.cis.upenn.edu/%7Elorisdan/images/arxivsub.pdf
, Nondeterministic Streaming String Transducers, ICALP, pp.1-20, 2011.
DOI : 10.1007/BF00264285
URL : http://www.cis.upenn.edu/~alur/Icalp11.pdf
, Regular Transformations of Infinite Strings, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.65-74, 2012.
DOI : 10.1109/LICS.2012.18
URL : https://hal.archives-ouvertes.fr/hal-01196262
, Polynomial automata: Zeroness and applications, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
DOI : 10.1109/LICS.2017.8005101
, Two-Way Visibly Pushdown Automata and Transducers, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.217-226, 2016.
DOI : 10.1007/978-3-642-59126-6_7
URL : https://hal.archives-ouvertes.fr/hal-01475442
, Aperiodic String Transducers, Developments in Language Theory -20th International Conference, DLT 2016, pp.125-137, 2016.
DOI : 10.1007/978-3-642-37064-9_48
URL : https://hal.archives-ouvertes.fr/hal-01475444
, MSO definable string transductions and two-way finite-state transducers, ACM Transactions on Computational Logic, vol.2, issue.2, pp.216-254, 2001.
DOI : 10.1145/371316.371512
URL : http://arxiv.org/pdf/cs/9906007v1.pdf
, Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations, Information and Computation, vol.154, issue.1, pp.34-91, 1999.
DOI : 10.1006/inco.1999.2807
URL : https://doi.org/10.1006/inco.1999.2807
, The equivalence problem for deterministic MSO tree transducers is decidable, Information Processing Letters, vol.100, issue.5, pp.206-212, 2006.
DOI : 10.1016/j.ipl.2006.05.015
URL : http://arxiv.org/pdf/cs/0506014
, First-order definable string transformations, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, pp.147-159
, Transducers, logic and algebra for functions of finite words, pp.4-19, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01475445
, The unsolvability of the Equivalence Problem for ??-Free nondeterministic generalized machines, Journal of the ACM, vol.15, issue.3, pp.409-413, 1968.
DOI : 10.1145/321466.321473
, The equivalence of finite valued transducers (on HDT0L languages) is decidable, Theor. Comput. Sci, vol.47, issue.3, pp.71-84, 1986.
, Mathematical models for cellular interactions in development I. Filaments with one-sided inputs, Journal of Theoretical Biology, vol.18, issue.3, pp.280-315, 1968.
DOI : 10.1016/0022-5193(68)90079-9
, On finite semigroups of matrices, Theoretical Computer Science, vol.5, issue.2, pp.101-111, 1977.
DOI : 10.1016/0304-3975(77)90001-9
URL : https://doi.org/10.1016/0304-3975(77)90001-9
, Equivalence of deterministic top-down treeto-string transducers is decidable, IEEE 56th Annual Symp. on Foundations of Computer Science, FOCS 2015, pp.943-962, 2015.
DOI : 10.1145/3182653
URL : http://arxiv.org/pdf/1503.09163