Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

Proceedings of the International Conference FCT 1985, Cottbus, GDR, September 9-13, 1985

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Lothar Budach
    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 199)

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 69.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 (53 papers)

  1. Front Matter

    Download chapter PDF

  2. Space complexity of alternating Turing machines

    • Māris Alberts
    Pages 1-7

  3. A unifying theorem for algebraic semantics and dynamic logics

    • H. Andreka, I. Guessarian, I. Németi
    Pages 8-17

  4. On some "non-uniform" complexity measures

    • J. L. Balcázar, J. Díaz, J. Gabarró
    Pages 18-27

  5. Fast parallel vertex colouring

    • F. Bauernöppel, H. Jung
    Pages 28-35

  6. Muller automata and bi-infinite words

    • Danièle Beauquier
    Pages 36-43

  7. On formal languages, probabilities, paging and decoding algorithms

    • Joffroy Beauquier, Loÿs Thimonier
    Pages 44-52

  8. On the restriction of some NP-complete graph problems to permutation graphs

    • Andreas Brandstädt, Dieter Kratsch
    Pages 53-62

  9. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic

    • A. L. Chistov
    Pages 63-69

  10. Algorithms solving path systems

    • Bogdan S. Chlebus
    Pages 70-79

  11. Decidability of confluence for ground term rewriting systems

    • M. Dauchet, S. Tison
    Pages 80-89

  12. Lower bounds on the complexity of 1-time only branching programs (Preliminary version)

    • Paul. E. Dunne
    Pages 90-99

  13. On coordinated rewriting

    • A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg
    Pages 100-111

  14. Elements of a general theory of combinatorial structures

    • Philippe Flajolet
    Pages 112-127

  15. A language theoretic approach to serialization problem in concurrent systems

    • M. P. Flé, G. Roucairol
    Pages 128-145

  16. Logic programming and substitutions

    • Gudmund Frandsen
    Pages 146-158

  17. A lower bound on the oscilation complexity of context-free languages

    • T. Gundermann
    Pages 159-166

  18. Depth efficient transformations of arithmetic into boolean circuits

    • Hermann Jung
    Pages 167-174

  19. Free cost measures of trees

    • R. Kemp
    Pages 175-190

  20. Discrete extremal problems on covering

    • A. D. Korshunov
    Pages 191-207
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation