Computation Theory

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

AvAndrzej Skowron

Häftad, Engelska, 1985

Del i serien Lecture Notes in Computer Science

535 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1985-12-01
Mått:155 x 235 x 23 mm
Vikt:622 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:402
Upplaga:1985
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540160663

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Innehållsförteckning

An algorithmic interface structure for pascal compilers.- Nonuniform complexity classes, decision graphs and homological properties of posets.- On the control of concurrent systems by restrictions of the state behaviour.- From domino tilings to a new model of computation.- Nondeterministic Propositional Dynamic Logic with intersection is decidable.- A note on selection networks.- Correctness of inconsistent theories with notions of feasibility.- On the log-space reducibility among array languages /preliminary version/.- Non-uniformity of dynamic logic.- Model theory of propositional logics of programs, some open problems.- Some results on decision trees with relations to computational trees.- Propositional calculi of term satisfiability and process logics.- On the effectiveness of some operations on algorithms.- Concatenation of program modules an algebraic approach to the semantic and implementation problems.- Regular expressions for infinite trees and a standard form of automata.- Equational ?-calculus.- A logic of indiscernibility relations.- Rough sets and decision tables.- On learning — a rough set approach.- A methodology for improving parallel programs by adding communications.- Extension of PDL and consequence relations.- Rough-sets based learning systems.- Theories of interacting stacks.- Rough concepts logic.- An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic.- On the recognition of context-free languages.- On multi-valued homomorphisms.- Traces and semiwords.- Deadlock prediction in linear systems.- Propositional dynamic logics with counters and stacks.- Transition graphs semantics and languages.- On the implementation of CSP mechanisms in loglan.

Mer från samma författare

Handbook of Granular Computing

Witold Pedrycz, Andrzej Skowron, Vladik Kreinovich

Inbunden

3 621 kr

Concurrency, Specification and Programming

Bernd-Holger Schlingloff, Thomas Vogel, Andrzej Skowron

Inbunden

1 732 kr

Concurrency, Specification and Programming

Bernd-Holger Schlingloff, Thomas Vogel, Andrzej Skowron

Häftad

1 732 kr

Active Media Technology

Tetsuya Yoshida, Gang Kou, Andrzej Skowron, Jiannong Cao, Hakim Hacid, Ning Zhong

Häftad

551 kr

Thriving Rough Sets

Guoyin Wang, Andrzej Skowron, Yiyu Yao, Dominik Ślęzak, Lech Polkowski

Inbunden

1 095 kr

Foundations of Intelligent Systems

Marzena Kryszkiewicz, Annalisa Appice, Dominik Ślęzak, Henryk Rybinski, Andrzej Skowron, Zbigniew W. Raś

Häftad

551 kr

Thriving Rough Sets

Guoyin Wang, Andrzej Skowron, Yiyu Yao, Dominik Ślęzak, Lech Polkowski

Häftad

1 095 kr

Transactions on Rough Sets III

James F. Peters, Andrzej Skowron

Häftad

551 kr

Transactions on Rough Sets V

III Peters, James F., Andrzej Skowron

Häftad

551 kr

Rough Sets and Current Trends in Computing

Andrzej Skowron, Lech Polkowski, Lech Polkowski

Häftad

551 kr

Mer från samma serie

Nyhet

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad

900 kr