Verwandte Artikel zu Mathematical Foundations of Computer Science 1975:...
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975: 32 (Lecture Notes in Computer Science) - Softcover
EUR 6,32
EUR 8,03 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Mathematical Foundations of Computer Science 1975:...
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975: 32 (Lecture Notes in Computer Science, 32) [Paperback] Becvar, J.
Anbieter: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Some wear to the extremities of the book. Marks in places. Inscriptions and light foxing at the front of the book. Clean and readable throughout, a decent paperback. Bestandsnummer des Verkäufers 109511-11
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical foundations of computer science 1975: 4th Symposium, Marianske Lazne, Sept. 1 - 5, 1975. Lectures notes in computer science ; 32
Verlag:
Berlin, Heidelberg, New York : Springer, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
Gebraucht
Broschiert
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Broschiert. Zustand: Gut. X, 476 S. : graph. Darst. Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 730. Bestandsnummer des Verkäufers 2174290
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1975
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 concern. Bestandsnummer des Verkäufers 4879575
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1975 : 4th Symposium Marianske Lazne, September 1-5, 1975
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - InhaltsangabeConstruction 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 synthesis problems 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. Bestandsnummer des Verkäufers 9783540073895
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -InhaltsangabeConstruction 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 synthesis problems 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 496 pp. Englisch. Bestandsnummer des Verkäufers 9783540073895
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1975
Verlag:
Springer Berlin Heidelberg Aug 1975, 1975
ISBN 10: 3540073892
ISBN 13: 9783540073895
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -InhaltsangabeConstruction 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 synthesis problems 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. 496 pp. Englisch. Bestandsnummer des Verkäufers 9783540073895
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1975: 4th Symposium Marianske Lazne, September 1-5, 1975 (Lecture Notes in Computer Science, 32)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540073895_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1975
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540073895
Anzahl: 10 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1975
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 476. Bestandsnummer des Verkäufers 183063734
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1975
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 476. Bestandsnummer des Verkäufers 263063740
Anzahl: 4 verfügbar