Articles liés à Mathematical Foundations of Computer Science 1979:...
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings - Couverture souple
Synopsis
No Mathematical Foundations of Computer Science 1979 Read a customer review or write one .
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Mathematical Foundations of Computer Science 1979:...
Image d'archives
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783540095262
Acheter neuf
EUR 46,87
Expédition à EUR 18,25
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1979
Edité par
Springer Berlin Heidelberg Jul 1979, 1979
ISBN 10 : 3540095268
ISBN 13 : 9783540095262
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A sound and complete proof system for partial program correctness.- The problem of reachability and verification of programs.- Assertion programming.- Complexity classes of formal languages.- Fast probabilistic algorithms.- Relative succinctness of representations of languages and separation of complexity classes.- On two types of loops.- Full abstraction for a simple parallel programming language.- On some developments in cryptography and their applications to computer science.- Searching, sorting and information theory.- Lcf: A way of doing proofs with a machine.- Axioms or algorithms.- Power from power series.- Computational complexity of string and graph ident ification.- A survey of grammar and l forms-1978.- A theoretical study on the time analysis of programs.- Completeness problems in verification of programs and program schemes.- Relationships between AFDL's and cylinders.- Computable data types.- Program equivalence and provability.- Interactive L systems with almost interactionless behaviour.- On the simplification of constructions in degrees of unsolvability via computational complexity.- An algebraic extension of the Chomsky ¿ hierarchy.- Bounds on computational complexity and approximability of initial segments of recursive sets.- On the weighted path length of binary search trees for unknown access probabilities.- Computational complexity of approximation algorithms for combinatorial problems.- A reduct-and-closure algorithm for graphs.- Small universal Minsky machines.- Parallel and two-way recognizers of directed acyclic graphs.- Fully effective solutions of recursive domain equations.- A note on computational complexity of a statistical deducibility testing procedure.- Context free normal systems.- New proofs for jump dpda's.- Synchronization and maximality for very pure subsemigroups of a free semigroup.- On the sets of minimal indices of partial recursive functions.- Some remarks on Boolean sums.- On the propositional algorithmic logic.- Ch(k) grammars: A characterization of LL(k) languages.- A uniform approach to balanced binary and multiway trees.- On the generative capacity of some classes of grammars with regulated rewriting.- Validity test for Floyd's operator-precedence parsing algorithms.- On the languages of bounded Petri nets.- Dyck language D2 is not absolutely parallel.- Fixed points in the power-set algebra of infinite trees.- On relaxation rules in algorithmic logic.- L-Fuzzy functorial automata.- Schematics of structural parallel programming and its applications.- On axiomatization of deterministic propositional dynamic logic.- Bounded recursion and complexity classes.- Characterization of rational and algebraic power series.- A crossing measure for 2-tape Turing machines.- The complexity of lexicographic sorting and searching.- An algebraic approach to concurrence.- On multitape automata.- A turing machine oracle hierarchy.- A survey of some syntactic results in the -calculus.- On rational expressions representing infinite rational trees : Application to the structure of flow charts. 596 pp. Englisch. N° de réf. du vendeur 9783540095262
Acheter neuf
EUR 42,79
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1979 : 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 5907956-n
Acheter neuf
EUR 64,77
Expédition à EUR 2,35
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science, 74)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In English. N° de réf. du vendeur ria9783540095262_new
Acheter neuf
EUR 55,57
Expédition à EUR 13,30
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1979 : 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
Edité par
Springer, 1979
ISBN 10 : 3540095268
ISBN 13 : 9783540095262
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 5907956
Acheter D'occasion
EUR 69,96
Expédition à EUR 2,35
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1979 : 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - A sound and complete proof system for partial program correctness.- The problem of reachability and verification of programs.- Assertion programming.- Complexity classes of formal languages.- Fast probabilistic algorithms.- Relative succinctness of representations of languages and separation of complexity classes.- On two types of loops.- Full abstraction for a simple parallel programming language.- On some developments in cryptography and their applications to computer science.- Searching, sorting and information theory.- Lcf: A way of doing proofs with a machine.- Axioms or algorithms.- Power from power series.- Computational complexity of string and graph ident ification.- A survey of grammar and l forms-1978.- A theoretical study on the time analysis of programs.- Completeness problems in verification of programs and program schemes.- Relationships between AFDL's and cylinders.- Computable data types.- Program equivalence and provability.- Interactive L systems with almost interactionless behaviour.- On the simplification of constructions in degrees of unsolvability via computational complexity.- An algebraic extension of the Chomsky - hierarchy.- Bounds on computational complexity and approximability of initial segments of recursive sets.- On the weighted path length of binary search trees for unknown access probabilities.- Computational complexity of approximation algorithms for combinatorial problems.- A reduct-and-closure algorithm for graphs.- Small universal Minsky machines.- Parallel and two-way recognizers of directed acyclic graphs.- Fully effective solutions of recursive domain equations.- A note on computational complexity of a statistical deducibility testing procedure.- Context free normal systems.- New proofs for jump dpda's.- Synchronization andmaximality for very pure subsemigroups of a free semigroup.- On the sets of minimal indices of partial recursive functions.- Some remarks on Boolean sums.- On the propositional algorithmic logic.- Ch(k) grammars: A characterization of LL(k) languages.- A uniform approach to balanced binary and multiway trees.- On the generative capacity of some classes of grammars with regulated rewriting.- Validity test for Floyd's operator-precedence parsing algorithms.- On the languages of bounded Petri nets.- Dyck language D2 is not absolutely parallel.- Fixed points in the power-set algebra of infinite trees.- On relaxation rules in algorithmic logic.- L-Fuzzy functorial automata.- Schematics of structural parallel programming and its applications.- On axiomatization of deterministic propositional dynamic logic.- Bounded recursion and complexity classes.- Characterization of rational and algebraic power series.- A crossing measure for 2-tape Turing machines.- The complexity of lexicographic sorting and searching.- An algebraic approach to concurrence.- On multitape automata.- A turing machine oracle hierarchy.- A survey of some syntactic results in the -calculus.- On rational expressions representing infinite rational trees : Application to the structure of flow charts. N° de réf. du vendeur 9783540095262
Acheter neuf
EUR 46,57
Expédition à EUR 35
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1979
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 596. N° de réf. du vendeur 263063682
Acheter neuf
EUR 78,69
Expédition à EUR 3,56
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1979
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Print on Demand pp. 596 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5832797
Acheter neuf
EUR 76,62
Expédition à EUR 7,66
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Mathematical Foundations of Computer Science 1979
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 596. N° de réf. du vendeur 183063688
Acheter neuf
EUR 74,56
Expédition à EUR 9,95
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Mathematical Foundations of Computer Science 1979
Edité par
Springer Berlin Heidelberg, 1979
ISBN 10 : 3540095268
ISBN 13 : 9783540095262
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A sound and complete proof system for partial program correctness.- The problem of reachability and verification of programs.- Assertion programming.- Complexity classes of formal languages.- Fast probabilistic algorithms.- Relative succinctness of represen. N° de réf. du vendeur 4880499
Acheter neuf
EUR 39,60
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles