On the Algebraic Structure of Rooted Trees

Calvin C. Elgot, Stephen L. Bloom and Ralph Tindell
Additional contact information
Calvin C. Elgot: IBM T. J. Watson Research Center, Mathematical Sciences Department
Stephen L. Bloom: Stevens Institute of Technology, Department of Mathematics
Ralph Tindell: Stevens Institute of Technology, Department of Mathematics

A chapter in Selected Papers, 1978, pp 236-273 from Springer

Abstract: Abstract Many kinds of phenomena are studied with the aid of (rooted) digraphs such as those indicated by Figs. 1.1 and 1.2. Figure 1.1 Figure 1.2 The two digraphs, while different, usually represent the same phenomenon, say, the same “computational process.” Our interest in rooted trees stems from the fact that these two digraphs “unfold” into the SAME infinite tree. In some cases at least it is also true that different (i.e. non-isomorphic) trees represent different phenomena (of the same kind). In these cases the unfolding (i.e. the trees) are surrogates for the phenomena.

Keywords: Rooted Tree; Normal Tree; Finite Index; Algebraic Theory; Normal Description (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-8177-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461381778

DOI: 10.1007/978-1-4613-8177-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().