Skip to main content
SpringerLink
Log in
Book cover

Computation Theory

Fifth Symposium, Zaborow, Poland, December 3-8, 1984 Proceedings

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Andrzej Skowron
    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 208)

Included in the following conference series:

Conference proceedings info: SCT 1984.

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Download chapter PDF

  2. An algorithmic interface structure for pascal compilers

    • Klaus Bothe
    Pages 1-6

  3. Nonuniform complexity classes, decision graphs and homological properties of posets

    • L. Budach, B. Graw
    Pages 7-13

  4. On the control of concurrent systems by restrictions of the state behaviour

    • Hans-Dieter Burkhard
    Pages 14-23

  5. From domino tilings to a new model of computation

    • Bogdan S. Chlebus
    Pages 24-33

  6. Nondeterministic Propositional Dynamic Logic with intersection is decidable

    • Ryszard Danecki
    Pages 34-53

  7. A note on selection networks

    • Krzysztof Diks
    Pages 54-57

  8. Correctness of inconsistent theories with notions of feasibility

    • A. G. Dragalin
    Pages 58-79

  9. On the log-space reducibility among array languages /preliminary version/

    • Marek Ejsmont
    Pages 80-90

  10. Non-uniformity of dynamic logic

    • Michał Grabowski
    Pages 91-97

  11. Model theory of propositional logics of programs, some open problems

    • Z. Habasiński
    Pages 98-110

  12. Some results on decision trees with relations to computational trees

    • Jerzy W. Jaromczyk
    Pages 111-117

  13. Propositional calculi of term satisfiability and process logics

    • R. Knast
    Pages 118-126

  14. On the effectiveness of some operations on algorithms

    • Wojciech Kowalczyk
    Pages 127-133

  15. Concatenation of program modules an algebraic approach to the semantic and implementation problems

    • Manfred Krause, Hans Langmaack, Antoni Kreczmar, Marek Warpechowski
    Pages 134-156

  16. Regular expressions for infinite trees and a standard form of automata

    • A. W. Mostowski
    Pages 157-168

  17. Equational μ-calculus

    • Damian Niwiński
    Pages 169-176

  18. A logic of indiscernibility relations

    • Ewa Orlowska
    Pages 177-186

  19. Rough sets and decision tables

    • Z. Pawlak
    Pages 187-196

  20. On learning — a rough set approach

    • Z. Pawlak
    Pages 197-227
Back to top

Other volumes

  1. Computation Theory

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation