Computation Theory (Record no. 33999)

000 -LEADER
fixed length control field 03358nam a22004455i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540397489
-- 978-3-540-39748-9
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Computation Theory
Sub Title Fifth Symposium, Zaborów, Poland December 3–8, 1984 Proceedings /
Statement of responsibility, etc edited by Andrzej Skowron.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1985.
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 402 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Skowron, Andrzej.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-16066-3
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1985.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK4705 http://dx.doi.org/10.1007/3-540-16066-3 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha