Jerzy Tiuryn. Implicit definability of finite binary trees by sets of equations. In Egon Börger, Gisbert Hasenjaeger, Dieter Rödding, editors, Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfahlen. Volume 171 of Lecture Notes in Computer Science, pages 320-332, Springer, 1983.
@inproceedings{Tiuryn83,
title = {Implicit definability of finite binary trees by sets of equations},
author = {Jerzy Tiuryn},
year = {1983},
researchr = {https://researchr.org/publication/Tiuryn83},
cites = {0},
citedby = {0},
pages = {320-332},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfahlen},
editor = {Egon Börger and Gisbert Hasenjaeger and Dieter Rödding},
volume = {171},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-13331-3},
}