Computation Theory - neues Buch

EAN (ISBN-13): 9783540397489
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-29T17:51:15+01:00 (Berlin)
Detailseite zuletzt geändert am 2018-08-30T17:19:03+02:00 (Berlin)
ISBN/EAN: 9783540397489

ISBN - alternative Schreibweisen:
978-3-540-39748-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: theory computation

---

Daten vom Verlag:

Autor/in: Andrzej Skowron
Titel: Lecture Notes in Computer Science; Computation Theory - Fifth Symposium, Zaborow, Poland, December 3-8, 1984 Proceedings
Verlag: Springer; Springer Berlin
402 Seiten
Erscheinungsjahr: 2005-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 402 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik; Mathematik; Verstehen; Computation; Erfüllbarkeitsproblem der Aussagenlogik; algorithm; algorithms; automata; calculus; complexity; logic; regular expressions; semantics; algorithm analysis and problem complexity; C; Mathematics; Algorithms; Theory of Computation; Computer Science; Algorithmen und Datenstrukturen; Theoretische Informatik; BC

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.