The Cantor-Bendixson Analysis of Finite Trees
We present a measure on the structural complexity of finite and infinite trees and provide some first result on its relation to context-free grammars and context-free tree grammars. In particular this measure establishes a relation between the complexity of a language as a set, and the complexity of the objects it contains. We show its precise nature and prove its decidability for the formalisms we consider.
KeywordsDerivation Tree Complete Path Complete Binary Tree Finite Tree Formal Language Theory
Unable to display preview. Download preview PDF.
- 1.Berstel, J.: Transductions and Context-free Languages. Teubner, Stuttgart (1979)Google Scholar
- 3.Fraïssé, R.: Theory of Relations. Studies in logic and the foundations of mathematics, vol 118. North-Holland (1986)Google Scholar
- 9.Rounds, William C.: Mappings and grammars on trees. Mathematical Systems Theory 4(3), 257–287 (1970)Google Scholar