Computation Theory: Fifth Symposium, Zaborów, Poland December 3–8, 1984 Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 208

ISBN: 3540160663, 9783540160663

Size: 4 MB (4250822 bytes)

Pages: 402/404

File format:

Language:

Publishing Year:

Category: Tag:

Klaus Bothe (auth.), Andrzej Skowron (eds.)3540160663, 9783540160663


Table of contents :
An algorithmic interface structure for pascal compilers….Pages 1-6
Nonuniform complexity classes, decision graphs and homological properties of posets….Pages 7-13
On the control of concurrent systems by restrictions of the state behaviour….Pages 14-23
From domino tilings to a new model of computation….Pages 24-33
Nondeterministic Propositional Dynamic Logic with intersection is decidable….Pages 34-53
A note on selection networks….Pages 54-57
Correctness of inconsistent theories with notions of feasibility….Pages 58-79
On the log-space reducibility among array languages /preliminary version/….Pages 80-90
Non-uniformity of dynamic logic….Pages 91-97
Model theory of propositional logics of programs, some open problems….Pages 98-110
Some results on decision trees with relations to computational trees….Pages 111-117
Propositional calculi of term satisfiability and process logics….Pages 118-126
On the effectiveness of some operations on algorithms….Pages 127-133
Concatenation of program modules an algebraic approach to the semantic and implementation problems….Pages 134-156
Regular expressions for infinite trees and a standard form of automata….Pages 157-168
Equational μ-calculus….Pages 169-176
A logic of indiscernibility relations….Pages 177-186
Rough sets and decision tables….Pages 187-196
On learning — a rough set approach….Pages 197-227
A methodology for improving parallel programs by adding communications….Pages 228-250
Extension of PDL and consequence relations….Pages 251-264
Rough-sets based learning systems….Pages 265-275
Theories of interacting stacks….Pages 276-287
Rough concepts logic….Pages 288-297
An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic….Pages 298-317
On the recognition of context-free languages….Pages 318-325
On multi-valued homomorphisms….Pages 326-331
Traces and semiwords….Pages 332-349
Deadlock prediction in linear systems….Pages 350-363
Propositional dynamic logics with counters and stacks….Pages 364-374
Transition graphs semantics and languages….Pages 375-384
On the implementation of CSP mechanisms in loglan….Pages 385-397

Reviews

There are no reviews yet.

Be the first to review “Computation Theory: Fifth Symposium, Zaborów, Poland December 3–8, 1984 Proceedings”
Shopping Cart
Scroll to Top