Skip to main content
SpringerLink
Log in

Classes of functions over binary trees

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 117))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cobham, A.: The intrinsic computational complexity of functions, Proc. 1964 Intern. Congr. on Logic, 24–30

    Google Scholar 

  2. Cohors-Fresenborg,E.: Subrekursive Funktionenklassen über binären Bäumen. Dissertation, Münster 1971

    Google Scholar 

  3. Thompson,D.B.: Subrecursiveness:Machine-independent Notions of Computability in Restricted Time and Storage,MSTG(1972), 3–15

    Google Scholar 

  4. Wagner, K.: Bounded recursion and complexity classes.MFCS 1979, Lecture Notes 74

    Google Scholar 

198

  1. Rozenberg, G., Selective substitution grammars (towards a framework for rewriting systems). Part I: definitions and examples. EIK, 13 /1977/, 455–463.

    Google Scholar 

  2. Rozenberg, G. and Salomaa, A., The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    Google Scholar 

  3. Rozenberg, G. and Wood, D., Context-free grammars with selective rewriting. Acta Informatica, 13/1980/, 257–268.

    Google Scholar 

  4. Salomaa, A., Formal Languages. Academic Press, New York, 1973.

    Google Scholar 

333

  1. A. Ehrenfeucht and G. Rozenberg, On the subword complexity of DOL languages with a constant distribution, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, Technical Report No. 81–21, 1981.

    Google Scholar 

  2. K.P. Lee, Subwords of developmental languages, Ph.D. thesis, State University of New York at Buffalo, 1975.

    Google Scholar 

  3. G. Rozenberg and A. Salomaa, The mathematical theory of L Systems, Academic Press, London, New York, 1980.

    Google Scholar 

  4. A. Thue, Über unendliche Zeichenreihen, Norsk. Vid. Selsk. Skr. I Mat.-Nat.Kl. 7 (1906), 1–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für mathematische Logik und Grundlagenforschung, D-4400, Münster, Germany

    Hans Kleine Büning

Authors
  1. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Büning, H.K. (1981). Classes of functions over binary trees. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation