Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1981

CAAP '81

Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings

Editors:

  1. Egidio Astesiano
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Corrado Böhm
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

Buy it now

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

Other ways to access

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

Table of contents (25 papers)

  1. Front Matter

    PDF

  4. Trees as data and file structures

    • J. Nievergelt
    Pages 35-45

  5. Infinitary relations

    • Maurice Nivat
    Pages 46-75

  6. Full approximability of a class of problems over power sets

    • G. Ausiello, A. Marchetti Spaccamela, M. Protasi
    Pages 76-87

  9. Top-down tree-transducers for infinite trees I

    • J. Bilstein, W. Damm
    Pages 117-134

  10. Easy solutions are hard to find

    • Stephen L. Bloom, David B. Patterson
    Pages 135-146

  13. Applied tree enumerations

    • Nachum Dershowitz, Shmuel Zaks
    Pages 180-193

  15. On pushdown tree automata

    • Irène Guessarian
    Pages 211-223

  19. Grammars without erasing rules. the OI case

    • Bernard Leguy
    Pages 268-279
Back to top

Keywords

Back to top

Bibliographic Information

  • Book Title: CAAP '81

  • Book Subtitle: Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings

  • Editors: Egidio Astesiano, Corrado Böhm

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-10828-9

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10828-3Published: 01 June 1981

  • eBook ISBN: 978-3-540-38716-9Published: 30 June 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VI, 365

  • Topics: Mathematics, general, Algorithm Analysis and Problem Complexity, Theory of Computation

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Other ways to access

Search

Navigation