Test Sets for the Universal and Existential Closure of Regular Tree Languages

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]

Possibly Related Publications

The following publications are possibly variants of this publication: