LEADER 03899nam  22005775  450 
001 996466150503316
005 20200706174159.0
010   $a3-540-39748-5
024 7 $a10.1007/3-540-16066-3
035   $a(CKB)1000000000230492
035   $a(SSID)ssj0000322008
035   $a(PQKBManifestationID)11246826
035   $a(PQKBTitleCode)TC0000322008
035   $a(PQKBWorkID)10281226
035   $a(PQKB)10576255
035   $a(DE-He213)978-3-540-39748-9
035   $a(PPN)155191071
035   $a(EXLCZ)991000000000230492
100   $a20121227d1985      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aComputation Theory$b[electronic resource] $eFifth Symposium, Zaborow, Poland, December 3-8, 1984 Proceedings /$fby Andrzej Skowron
205   $a1st ed. 1985.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1985.
215   $a1 online resource (X, 402 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v208
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-16066-3 
327   $aAn 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v208
606   $aMathematics
606   $aAlgorithms
606   $aComputers
606   $aMathematics, general$3https://scigraph.springernature.com/ontologies/product-market-codes/M00009
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
615  0$aMathematics.
615  0$aAlgorithms.
615  0$aComputers.
615 14$aMathematics, general.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aTheory of Computation.
676   $a510
700   $aSkowron$b Andrzej$4aut$4http://id.loc.gov/vocabulary/relators/aut$0895878
906   $aBOOK
912   $a996466150503316
996   $aComputation Theory$92831013
997   $aUNISA