Contents of Volume 21
-
Transition systems and concurrent processes Banach Center Publications 21 (1988), 9-20 DOI: 10.4064/-21-1-9-20
-
Categories of partial morphisms and the relation between type structures. Partial variations on a theme of Friedman and Statman Banach Center Publications 21 (1988), 21-45 DOI: 10.4064/-21-1-21-45
-
An operational semantics for process algebra Banach Center Publications 21 (1988), 47-81 DOI: 10.4064/-21-1-47-81
-
Construction of parallel programs with networks of cooperating processes Banach Center Publications 21 (1988), 83-96 DOI: 10.4064/-21-1-83-96
-
The complexity of classification problems Banach Center Publications 21 (1988), 97-113 DOI: 10.4064/-21-1-97-113
-
Closed sets of universal Horn formulas for many-sorted (partial) algebras Banach Center Publications 21 (1988), 129-143 DOI: 10.4064/-21-1-129-143
-
Fairness for synchronous fork-join nets Banach Center Publications 21 (1988), 145-158 DOI: 10.4064/-21-1-145-158
-
An axiomatic theory of information trees Banach Center Publications 21 (1988), 159-167 DOI: 10.4064/-21-1-159-167
-
How to treat decision problems by different programming methodologies Banach Center Publications 21 (1988), 185-196 DOI: 10.4064/-21-1-185-196
-
A note on the minimalization of tree-automata Banach Center Publications 21 (1988), 197-203 DOI: 10.4064/-21-1-197-203
-
Synchronous parallelizations of serial computer programs Banach Center Publications 21 (1988), 205-224 DOI: 10.4064/-21-1-205-224
-
Categorical equivalences of varieties generated by algebras ${\germ A}$ and ${\germ A}^r$ Banach Center Publications 21 (1988), 225-233 DOI: 10.4064/-21-1-225-233
-
The second machine class 2, an encyclopedic view on the parallel computation thesis Banach Center Publications 21 (1988), 235-256 DOI: 10.4064/-21-1-235-256
-
Functional compiler description Banach Center Publications 21 (1988), 257-275 DOI: 10.4064/-21-1-257-275
-
Elementary properties of the class of nondeterministic polynomial time computable functions Banach Center Publications 21 (1988), 277-283 DOI: 10.4064/-21-1-277-283
-
Square-free and overlap-free words Banach Center Publications 21 (1988), 285-297 DOI: 10.4064/-21-1-285-297
-
Finite and infinite computations of logic programs Banach Center Publications 21 (1988), 299-313 DOI: 10.4064/-21-1-299-313
-
Effective constructions of grammars Banach Center Publications 21 (1988), 315-328 DOI: 10.4064/-21-1-315-328
-
Kripke models with relative accessibility and their applications to inferences from incomplete information Banach Center Publications 21 (1988), 329-339 DOI: 10.4064/-21-1-329-339
-
The extent to which linear problems have linear optimal algorithms Banach Center Publications 21 (1988), 341-357 DOI: 10.4064/-21-1-341-357
-
Deriving programs using higher-order generalization Banach Center Publications 21 (1988), 359-368 DOI: 10.4064/-21-1-359-368
-
On the use of homomorphisms for proving the equivalence of some programs Banach Center Publications 21 (1988), 377-384 DOI: 10.4064/-21-1-377-384
-
On some arithmetically expressible properties of programs Banach Center Publications 21 (1988), 385-394 DOI: 10.4064/-21-1-385-394
-
Finite categories and regular languages Banach Center Publications 21 (1988), 395-402 DOI: 10.4064/-21-1-395-402
-
Safety- and liveness-properties in propositional temporal logic: characterizations and decidability Banach Center Publications 21 (1988), 403-417 DOI: 10.4064/-21-1-403-417
-
Propositional dynamic logic with recursive programs Banach Center Publications 21 (1988), 419-426 DOI: 10.4064/-21-1-419-426
-
Countable nondeterminism and logics of programs: fair-wellfoundedness of while-programs with nondeterministic assignments in the logic ALNA Banach Center Publications 21 (1988), 427-436 DOI: 10.4064/-21-1-427-436
-
Iterative nondeterministic algebras Banach Center Publications 21 (1988), 437-447 DOI: 10.4064/-21-1-437-447
-
More about the closure of NP Banach Center Publications 21 (1988), 449-458 DOI: 10.4064/-21-1-449-458
-
Information-based complexity and operator equations Banach Center Publications 21 (1988), 459-486 DOI: 10.4064/-21-1-459-486
-
О сложности приближенного вычисления непрерывных функций Banach Center Publications 21 (1988), 487-497 DOI: 10.4064/-21-1-487-497
-
О глубине булевых функций, реализуемых контактными схемами заданной сложности Banach Center Publications 21 (1988), 499-502 DOI: 10.4064/-21-1-499-502
-
Об одном подходе к оценке пространственной сложности схем из функциональных элементов Banach Center Publications 21 (1988), 503-5121988 DOI: 10.4064/-21-1-503-5121988
-
Оценка числа представительных наборов для одного класса бинарных таблиц Banach Center Publications 21 (1988), 513-522 DOI: 10.4064/-21-1-513-522
-
О соотношении глубины детерминированных и недетерминированных бесконтурных программ в базисе {х + у, х — у, 1; signx} Banach Center Publications 21 (1988), 523-529 DOI: 10.4064/-21-1-523-529
-
Линейные нижние оценки сложности и их математические модели Banach Center Publications 21 (1988), 531-542 DOI: 10.4064/-21-1-531-542
-
Об эффективных нижних оценках сложности реализации функций в различных классах управляющих систем с ограничением на структуру схем Banach Center Publications 21 (1988), 543-555 DOI: 10.4064/-21-1-543-555
-
Понятие полного расширения функции частично определенной логической сети и его применение в диагностике дискретных устройств Banach Center Publications 21 (1988), 557-571 DOI: 10.4064/-21-1-557-571
-
О реализации булевских функций плоскими и объемными схемами из функциональных элементов Banach Center Publications 21 (1988), 573-583 DOI: 10.4064/-21-1-573-583
-
Метод разрешения семантических свойств алгоритмов Banach Center Publications 21 (1988), 585-597 DOI: 10.4064/-21-1-585-597
