Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSCT 1984: Zaborów, Poland
- Andrzej Skowron:
Computation Theory - Fifth Symposium, Zaborów, Poland, December 3-8, 1984, Proceedings. Lecture Notes in Computer Science 208, Springer 1985, ISBN 978-3-540-16066-3
- Klaus Bothe:
An algorithmic interface structure for pascal compilers. 1-6 - Lothar Budach, Bernd Graw:
Nonuniform complexity classes, decision graphs and homological properties of posets. 7-13 - Hans-Dieter Burkhard:
On the control of concurrent systems by restrictions of the state behaviour. 14-23 - Bogdan S. Chlebus:
From domino tilings to a new model of computation. 24-33 - Ryszard Danecki:
Nondeterministic Propositional Dynamic Logic with intersection is decidable. 34-53 - Krzysztof Diks:
A note on selection networks. 54-57 - Albert G. Dragálin:
Correctness of inconsistent theories with notions of feasibility. 58-79 - Marek Ejsmont:
On the log-space reducibility among array languages /preliminary version/. 80-90 - Michal Grabowski:
Non-uniformity of dynamic logic - Extended abstract. 91-97 - Zdzislaw Habasinski:
Model theory of propositional logics of programs, some open problems. 98-110 - Jerzy W. Jaromczyk:
Some results on decision trees with relations to computational trees. 111-117 - Robert Knast:
Propositional calculi of term satisfiability and process logics. 118-126 - Wojciech Kowalczyk:
On the effectiveness of some operations on algorithms. 127-133 - Manfred Krause, Hans Langmaack, Antoni Kreczmar, Marek Warpechowski:
Concatenation of program modules an algebraic approach to the semantic and implementation problems. 134-156 - Andrzej Wlodzimierz Mostowski:
Regular expressions for infinite trees and a standard form of automata. 157-168 - Ewa Orlowska:
A logic of indiscernibility relations. 177-186 - Zdzislaw Pawlak:
Rough sets and decision tables. 187-196 - Zdzislaw Pawlak:
On learning - a rough set approach. 197-227 - Alberto Pettorossi
, Andrzej Skowron:
A methodology for improving parallel programs by adding communications. 228-250 - Slavian Radev:
Extension of PDL and consequence relations. 251-264 - Zbigniew W. Ras, Maria Zemankova:
Rough-sets based learning systems. 265-275 - Helena Rasiowa:
Theories of interacting stacks. 276-287 - Helena Rasiowa, Andrzej Skowron:
Rough concepts logic. 288-297 - Cecylia Rauszer:
An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic. 298-317 - Wojciech Rytter:
On the recognition of context-free languages. 318-325 - Dimiter Skordev:
On multi-valued homomorphisms. 326-331 - Peter H. Starke:
Traces and semiwords. 332-349 - Zbigniew Suraj:
Deadlock prediction in linear systems. 350-363 - Tinko Tinchev, Dimiter Vakarelov:
Propositional dynamic logics with counters and stacks. 364-374 - Marisa Venturini Zilli:
Transition graphs semantics and languages. 375-384 - Jolanta Warpechowska:
On the implementation of CSP mechanisms in loglan. 385-397
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-05-28 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
