Dieter Hofbauer, Maria Huber. Test Sets for the Universal and Existential Closure of Regular Tree Languages. In Paliath Narendran, Michaël Rusinowitch, editors, Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings. Volume 1631 of Lecture Notes in Computer Science, pages 205-219, Springer, 1999. [doi]
@inproceedings{HofbauerH99,
title = {Test Sets for the Universal and Existential Closure of Regular Tree Languages},
author = {Dieter Hofbauer and Maria Huber},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1631/16310205.htm},
tags = {testing},
researchr = {https://researchr.org/publication/HofbauerH99},
cites = {0},
citedby = {0},
pages = {205-219},
booktitle = {Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings},
editor = {Paliath Narendran and Michaël Rusinowitch},
volume = {1631},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66201-4},
}