| Description |
1 online resource (vii, 397 pages) : illustrations |
| Series |
Lecture notes in computer science ; 208 |
|
Lecture notes in computer science ; 208.
|
| Contents |
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 |
| Bibliography |
Includes bibliographical references |
| Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL |
|
Print version record |
| Subject |
Machine theory -- Congresses
|
|
Computational complexity -- Congresses
|
|
Computational complexity
|
|
Machine theory
|
| Genre/Form |
Conference papers and proceedings
|
| Form |
Electronic book
|
| Author |
Skowron, Andrzej.
|
|
Symposium on Computation Theory (5th : 1984 : Zaborów, Poland)
|
| ISBN |
9783540397489 |
|
3540397485 |
|
