Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1977

6th Symposium, Tatranska Lomnica September 5-9, 1977. Proceedings

  • Conference proceedings
  • © 1977

Overview

Editors:
  1. Jozef Gruska
    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 53)

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 109.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 (61 papers)

  1. Front Matter

    Download chapter PDF

  2. On the structure and properties of NP-complete problems and their associated optimization problems

    • Giorgio Ausiello
    Pages 1-16

  3. A comparative review of some program verification methods

    • Andrzej Blikle
    Pages 17-33

  4. Classification of the context-free languages

    • L. Boasson
    Pages 34-43

  5. Finite automaton from a flowchart scheme point of view

    • Calvin C. Elgot
    Pages 44-51

  6. A new type of models of computation

    • E. Engeler
    Pages 52-58

  7. Correctness of mixed computation in ALGOL-like programs

    • A. P. Ershov, V. E. Itkin
    Pages 59-77

  8. Algebra and logic in theoretical computer science

    • Ferenc Gécseg, Péter E.-Tóth
    Pages 78-92

  9. A survey of recent problems and results in analytic computational complexity

    • B. Kacewicz, H. Woźniakowski
    Pages 93-107

  10. Tree-structures for set manipulation problems

    • H. A. Maurer, Th. Ottmann
    Pages 108-121

  11. Applied algorithmic logic

    • Andrzej Salwicki
    Pages 122-134

  12. Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials

    • C. P. Schnorr
    Pages 135-147

  13. Frequency algorithms and computations

    • B. A. Trakhtenbrot
    Pages 148-161

  14. Graph-theoretic arguments in low-level complexity

    • Leslie G. Valiant
    Pages 162-176

  15. Properties of complexity classes a short survey

    • Gerd Wechsung
    Pages 177-191

  16. A uniform approach to inductive posets and inductive closure

    • J. B. Wright, E. G. Wagner, J. W. Thatcher
    Pages 192-212

  17. Generalized probabilistic grammars

    • V. N. Agafonov
    Pages 213-221

  18. Classes of structurally isomorphic np-optimization problems

    • Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
    Pages 222-230

  19. Pushdown-automata and families of languages generating cylinders

    • Jean-Michel Autebert
    Pages 231-239

  20. Semantics of infinite processes using generalized trees

    • J. W. de Bakker
    Pages 240-246
Back to top

Keywords

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1977

  • Book Subtitle: 6th Symposium, Tatranska Lomnica September 5-9, 1977. Proceedings

  • Editors: Jozef Gruska

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-08353-7

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1977

  • Softcover ISBN: 978-3-540-08353-5Published: 01 August 1977

  • eBook ISBN: 978-3-540-37285-1Published: 13 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIII, 599

  • Topics: Theory of Computation, Computer Science, general

Publish with us

Policies and ethics

Back to top

Search

Navigation