Thomas Genet. Completeness of Tree Automata Completion. In Hélène Kirchner, editor, 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK. Volume 108 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{Genet18,
title = {Completeness of Tree Automata Completion},
author = {Thomas Genet},
year = {2018},
doi = {10.4230/LIPIcs.FSCD.2018.16},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2018.16},
researchr = {https://researchr.org/publication/Genet18},
cites = {0},
citedby = {0},
booktitle = {3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK},
editor = {Hélène Kirchner},
volume = {108},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-077-4},
}