03899nam 22005775 450 99646615050331620200706174159.03-540-39748-510.1007/3-540-16066-3(CKB)1000000000230492(SSID)ssj0000322008(PQKBManifestationID)11246826(PQKBTitleCode)TC0000322008(PQKBWorkID)10281226(PQKB)10576255(DE-He213)978-3-540-39748-9(PPN)155191071(EXLCZ)99100000000023049220121227d1985 u| 0engurnn|008mamaatxtccrComputation Theory[electronic resource] Fifth Symposium, Zaborow, Poland, December 3-8, 1984 Proceedings /by Andrzej Skowron1st ed. 1985.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1985.1 online resource (X, 402 p.) Lecture Notes in Computer Science,0302-9743 ;208Bibliographic Level Mode of Issuance: Monograph3-540-16066-3 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.Lecture Notes in Computer Science,0302-9743 ;208MathematicsAlgorithmsComputersMathematics, generalhttps://scigraph.springernature.com/ontologies/product-market-codes/M00009Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Mathematics.Algorithms.Computers.Mathematics, general.Algorithm Analysis and Problem Complexity.Theory of Computation.510Skowron Andrzejauthttp://id.loc.gov/vocabulary/relators/aut895878BOOK996466150503316Computation Theory2831013UNISA