Del 32 - Lecture Notes in Computer Science

Mathematical Foundations of Computer Science 1975

4th Symposium Marianske Lazne, September 1-5, 1975

Häftad, Engelska, 1975

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1975-08-15
Mått170 x 244 x 27 mm
Vikt848 g
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor480
Upplaga1975
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
EAN9783540073895

Du kanske också är intresserad av

Mathematical Foundations of Computer Science 1979

Del 74

Mathematical Foundations of Computer Science 1979

569 kr

Akrylfärg Simply 25 delar

Akrylfärg Simply 25 delar

Daler-Rowney

199 kr

Lera DAS 1kg vit

Lera DAS 1kg vit

DAS

89 kr

Hjärtslag : En självbiografi

Nyhet

Hjärtslag : En självbiografi

Björn Borg, Patricia Borg

349 kr

Lackeringskit DAS 75ml lack + pensel

Lackeringskit DAS 75ml lack + pensel

DAS

159 kr

Den yttersta hemligheten

Nyhet

Del 6

Den yttersta hemligheten

329 kr

Pojken på andra sidan havet

Nyhet

Pojken på andra sidan havet

299 kr359 kr

Modelleringsverktyg DAS trä 2-pack

Modelleringsverktyg DAS trä 2-pack

DAS

69 kr

Caminando Spanska Nybörjare Lärobok inkl ljud

Caminando Spanska Nybörjare Lärobok inkl ljud

Elisabet Waldenström, Ninni Westerman, Åsa Bretz, Åsa Gustafsson, Märet Wik-Bretz

589 kr

Väninnorna på Nordiska Kompaniet

Nyhet

Del 2

Väninnorna på Nordiska Kompaniet

Ruth Kvarnström-Jones

79 kr125 kr

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

Construction of complete sample system for correctness testing.- Ten years of speedup.- On logics of discovery.- On models of protection in operating systems.- Parsing as a subtask of compiling.- Parallel recursive program schemes.- On some problems concerning Pawlak's machines.- Formal power series and growth functions of Lindenmayer systems.- On the representability of relations by deterministic and nondeterministic multi-tape automata.- On problems solvable by successive trials.- Automata and categories.- On some models of computability of boolean functions.- Automata and categories: Finiteness contra minimality.- Languages over free groups.- On the comparison of notions of approximation.- Non-linear speed-up theorem for two register minsky machines.- Systems of open paths in Petri nets.- On the largest full sub — AFL of the full AFL of context-free languages.- On complexity of nondeterministic Turing machines computations.- On closure properties of context-free derivation complexity classes.- Control structures in single block programs.- Minimal Gödel numbers and their identification in the limit.- Isomorphic representation of automata.- Extended simple regular expressions.- Conniver programs by logical point of view.- On the set of all automata with the same monoid of endomorphisms.- Nondeterministically recognizable sets of languages.- The approximation problem in computational statistics.- The continuous algebra of monadic languages.- On sets of complex-programmed Numbers.- Decision algorithms for Havel's branching automata.- Automata and categories — Input processes.- Formalization of algorithmic reasoning.- Proving program properties, symbolic evaluation and logical procedural semantics.- A contribution to error recovery.- On the analysis and synthesisproblems for context-free expressions.- Monotone switching circuits and boolean matrix product.- On some lattice-theoretic properties of generable languages.- On some formal grammars generating dependency trees.- Graph walking automata.- On finding all solutions of the partitioning problem.- Greibach normal form complexity.- On correctness and essentiality of some Ianov schemas equivalence relations.- Polynomially complete problems in the logic of automate discovery.- Relational definition of computer languages.- First-order reduction of call-by-name to call-by-value.- Local disambiguating transformation.- On cardinal sequential outer measures.- On representation of sequential and parallel functions.- The theory of the modified post algebras and multidimensional automata structures.- An algebraic theory of formal languages.- On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups.- On the synthesis of automata with several initial states.- A hierarchy of regular sequence sets.- R-fuzzy grammars.- Characterization of some classes of context-free languages in terms of complexity classes.- Inductive inference of recursive functions.- Proving properties of programs by means of predicate logic.- A generalization of Scott's flow diagrams.