Computation Theory [[electronic resource] ] : Fifth Symposium, Zaborow, Poland, December 3-8, 1984 Proceedings / / by Andrzej Skowron

• Autore: Skowron Andrzej
• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985
• Edizione: 1st ed. 1985.
• Descrizione fisica: 1 online resource (X, 402 p.)
• Disciplina: 510
• Soggetto topico: Mathematics; Algorithms; Computers; Mathematics, general; Algorithm Analysis and Problem Complexity; Theory of Computation
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: 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.
• Titolo autorizzato: Computation Theory
• ISBN: 3-540-39748-5
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466150503316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 208