Symposium on Computation Theory

Keyphrases

Publications

volume 208, 1985

Computation Theory - Fifth Symposium, Zaborów, Poland, December 3-8, 1984, Proceedings Symposium on Computation Theory 208 (1985)

1984

Hans-Dieter Burkhard
On the control of concurrent systems by restrictions of the state behaviour. Symposium on Computation Theory (1984)
Krzysztof Diks
A note on selection networks. Symposium on Computation Theory (1984)
Klaus Bothe
An algorithmic interface structure for pascal compilers. Symposium on Computation Theory (1984)
Slavian Radev
Extension of PDL and consequence relations. Symposium on Computation Theory (1984)
Zdzislaw Pawlak
On learning - a rough set approach. Symposium on Computation Theory (1984)
Zdzislaw Pawlak
Rough sets and decision tables. Symposium on Computation Theory (1984)
Alberto Pettorossi, Andrzej Skowron
A methodology for improving parallel programs by adding communications. Symposium on Computation Theory (1984)
Robert Knast
Propositional calculi of term satisfiability and process logics. Symposium on Computation Theory (1984)
Helena Rasiowa, Andrzej Skowron
Rough concepts logic. Symposium on Computation Theory (1984)
Helena Rasiowa
Theories of interacting stacks. Symposium on Computation Theory (1984)
Bogdan S. Chlebus
From domino tilings to a new model of computation. Symposium on Computation Theory (1984)
Michal Grabowski
Non-uniformity of dynamic logic - Extended abstract. Symposium on Computation Theory (1984)
Marisa Venturini Zilli
Transition graphs semantics and languages. Symposium on Computation Theory (1984)
Albert G. Dragálin
Correctness of inconsistent theories with notions of feasibility. Symposium on Computation Theory (1984)
Wojciech Rytter
On the recognition of context-free languages. Symposium on Computation Theory (1984)
Cecylia Rauszer
An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic. Symposium on Computation Theory (1984)
Andrzej Wlodzimierz Mostowski
Regular expressions for infinite trees and a standard form of automata. Symposium on Computation Theory (1984)
Peter H. Starke
Traces and semiwords. Symposium on Computation Theory (1984)
Zdzislaw Habasinski
Model theory of propositional logics of programs, some open problems. Symposium on Computation Theory (1984)
Ryszard Danecki
Nondeterministic Propositional Dynamic Logic with intersection is decidable. Symposium on Computation Theory (1984)
Zbigniew W. Ras, Maria Zemankova
Rough-sets based learning systems. Symposium on Computation Theory (1984)
Tinko Tinchev, Dimiter Vakarelov
Propositional dynamic logics with counters and stacks. Symposium on Computation Theory (1984)
Zbigniew Suraj
Deadlock prediction in linear systems. Symposium on Computation Theory (1984)
Wojciech Kowalczyk
On the effectiveness of some operations on algorithms. Symposium on Computation Theory (1984)
Lothar Budach, Bernd Graw
Nonuniform complexity classes, decision graphs and homological properties of posets. Symposium on Computation Theory (1984)
Dimiter Skordev
On multi-valued homomorphisms. Symposium on Computation Theory (1984)
Jerzy W. Jaromczyk
Some results on decision trees with relations to computational trees. Symposium on Computation Theory (1984)
Manfred Krause, Hans Langmaack, Antoni Kreczmar, Marek Warpechowski
Concatenation of program modules an algebraic approach to the semantic and implementation problems. Symposium on Computation Theory (1984)
Jolanta Warpechowska
On the implementation of CSP mechanisms in loglan. Symposium on Computation Theory (1984)
Ewa Orlowska
A logic of indiscernibility relations. Symposium on Computation Theory (1984)
Marek Ejsmont
On the log-space reducibility among array languages /preliminary version/. Symposium on Computation Theory (1984)