@InProceedings{genet:LIPIcs.FSCD.2018.16,
  author =	{Genet, Thomas},
  title =	{{Completeness of Tree Automata Completion}},
  booktitle =	{3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)},
  pages =	{16:1--16:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-077-4},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{108},
  editor =	{Kirchner, H\'{e}l\`{e}ne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2018.16},
  URN =		{urn:nbn:de:0030-drops-91868},
  doi =		{10.4230/LIPIcs.FSCD.2018.16},
  annote =	{Keywords: term rewriting systems, regularity preservation, over-approximation, completeness, tree automata, tree automata completion}
}