Adrien Boiret, Raphaela Palenta. Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time. In Srecko Brlek, Christophe Reutenauer, editors, Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings. Volume 9840 of Lecture Notes in Computer Science, pages 355-367, Springer, 2016. [doi]
@inproceedings{BoiretP16, title = {Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time}, author = {Adrien Boiret and Raphaela Palenta}, year = {2016}, doi = {10.1007/978-3-662-53132-7_29}, url = {http://dx.doi.org/10.1007/978-3-662-53132-7_29}, researchr = {https://researchr.org/publication/BoiretP16}, cites = {0}, citedby = {0}, pages = {355-367}, booktitle = {Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings}, editor = {Srecko Brlek and Christophe Reutenauer}, volume = {9840}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-662-53131-0}, }