State-space sets, state-space graphs and n-prefix expressions
Victor Köfalusi, Edit Halmay · ACM SIGSAM Bulletin · 1981
In this paper we intend to discuss some methods for solving a crucial problem in formula manipulation. This problem arises when a tree is elected -- as the best-fitting data structure - for the representation of a formula.