Skip to main content
SpringerLink
Log in

Theoretical Computer Science

4th GI Conference Aachen, March 26-28, 1979

  • Conference proceedings
  • © 1979

Overview

Editors:
  1. K. Weihrauch
    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 67)

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

Access this book

Log in via an institution
Softcover Book USD 39.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Download chapter PDF

  2. Context-free sets of infinite words

    • L. Boasson
    Pages 1-9

  3. New aspects of homomorphisms

    • H. Maurer
    Pages 10-24

  4. Can partial correctness assertions specify programming language semantics?

    • Irene Greif, Albert R. Meyer
    Pages 25-26

  5. An algebraic theory for synchronization

    • R. Milner
    Pages 27-35

  6. Storage modification machines

    • A. Schönhage
    Pages 36-37

  7. Negative results on counting

    • L. G. Valiant
    Pages 38-46

  8. Strong non-deterministic context-free languages

    • Joffroy Beauquier
    Pages 47-57

  9. Information content characterizations of complexity theoretic properties

    • Victor L. Bennison
    Pages 58-66

  10. Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen

    • Norbert Blum, Kurt Mehlhorn
    Pages 67-78

  11. A new recursion induction principle

    • Gerard Boudol
    Pages 79-90

  12. Finite-change automata

    • Burchard von Braunmühl, Rutger Verbeek
    Pages 91-100

  13. Move rules and trade-offs in the pebble game

    • Peter van Emde Boas, Jan van Leeuwen
    Pages 101-112

  14. Transition diagrams and strict deterministic grammars

    • Dietmar Friede
    Pages 113-123

  15. Exact expressions for some randomness tests

    • Péter Gács
    Pages 124-131

  16. On storage optimization for automatically generated compilers

    • Harald Ganzinger
    Pages 132-141

  17. On continuous completions

    • Irène Guessarian
    Pages 142-152

  18. A new method to show lower bounds for polynomials which are hard to compute

    • Joos Heintz
    Pages 153-157

  19. On zerotesting-bounded multicounter machines

    • Matthias Jantzen
    Pages 158-169

  20. When are two effectively given domains identical?

    • Akira Kanda, David Park
    Pages 170-181
Back to top

Keywords

Bibliographic Information

  • Book Title: Theoretical Computer Science

  • Book Subtitle: 4th GI Conference Aachen, March 26-28, 1979

  • Editors: K. Weihrauch

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-09118-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1979

  • Softcover ISBN: 978-3-540-09118-9Published: 05 March 1979

  • eBook ISBN: 978-3-540-35517-5Published: 13 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VII, 330

  • Topics: Theory of Computation, Computer Science, general

Publish with us

Policies and ethics

Back to top

Search

Navigation