Hostname: page-component-5c6d5d7d68-wtssw Total loading time: 0 Render date: 2024-08-17T23:32:21.826Z Has data issue: false hasContentIssue false
  • English
  • Français

A Decision Problem for Transformations of Trees

Published online by Cambridge University Press:  20 November 2018

Trevor Evans
Trevor Evans*
Affiliation:
Emory University, Atlanta, Georgia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For a given class of transformations on graphs there arises naturally the problem of deciding when one graph can be transformed into another by a finite sequence of such transformations. We consider, in this paper, the special case of this problem when the graphs are finite trees and the transformations consist of rearranging the order of the segments from a point and replacing subtrees by other trees according to a given set of pairs of interchangeable trees. This decision problem is, in fact, equivalent to the word problem for one-generator algebras in a certain variety of algebraic systems and we exhibit a procedure for solving the word problem for these algebras.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 15 , 1963 , pp. 584 - 590
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. Evans, T., The word problem for abstract algebras, J. London Math. Soc, 26 (1951), 64–71.Google Scholar
2. Evans, T., On multiplicative systems defined by generators and relations. I. Normal form theorems, Proc. Cambridge Phil. Soc, 47 (1951), 637–649.Google Scholar