Skip to main content
SpringerLink
Log in

The Cantor-Bendixson Analysis of Finite Trees

  • Conference paper
Formal Grammar (FG 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8612))

Included in the following conference series:

  • 623 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J.: Transductions and Context-free Languages. Teubner, Stuttgart (1979)

    Google Scholar 

  2. Engelfriet, J., Schmidt, E.M.: Io and oi. i. J. Comput. Syst. Sci. 15(3), 328–353 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  3. Fraïssé, R.: Theory of Relations. Studies in logic and the foundations of mathematics, vol 118. North-Holland (1986)

    Google Scholar 

  4. Greibach, S.A.: Chains of full AFL’s. Mathematical Systems Theory 4, 231–242 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hawkins, J.A.: Efficiency and Complexity in Grammars. Oxford Univ. Pr., Oxford (2004)

    Book  Google Scholar 

  6. Hofbauer, D., Huber, M., Kucherov, G.: Some results on top-context-free tree languages. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 157–171. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  7. Kepser, S., Rogers, J.: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars. Journal of Logic, Language and Information 20(3), 361–384 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kracht, M.: The Mathematics of Language. Studies in Generative Grammar, vol. 63. Mouton de Gruyter, Berlin (2003)

    Book  MATH  Google Scholar 

  9. Rounds, William C.: Mappings and grammars on trees. Mathematical Systems Theory 4(3), 257–287 (1970)

    Google Scholar 

  10. Rubin, S.: Automata presenting structures: A survey of the finite string case. Bulletin of Symbolic Logic 14(2), 169–209 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context–free grammars. Theor. Comp. Sci. 88, 191–229 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  12. Simmons, H.: The extendend Cantor-Bendixson analysis of trees. Algebra Universalis 52, 439–468 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Düsseldorf, Germany

    Christian Wurm

Authors
  1. Christian Wurm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes,Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado,1-3, 08034, Barcelona, Spain

    Glyn Morrill

  2. Department of Philosophy, Tilburg University, P.O. Box 90153, NL 5000, LE Tilburg, The Netherlands

    Reinhard Muskens

  3. Department of Linguistics and Information Science, Heinrich-Heine-University Düsseldorf, Universitätsstrasse 1, 40225, Düsseldorf, Germany

    Rainer Osswald

  4. Institute for English and American Studies, Department of Linguistic, Goethe University Frankfurt am Main, Grüneburgplatz 1, 60323, Frankfurt, Germany

    Frank Richter

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wurm, C. (2014). The Cantor-Bendixson Analysis of Finite Trees. In: Morrill, G., Muskens, R., Osswald, R., Richter, F. (eds) Formal Grammar. FG 2014. Lecture Notes in Computer Science, vol 8612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44121-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44121-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44120-6

  • Online ISBN: 978-3-662-44121-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation