Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.