Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science, 74) - Softcover
Synopsis
Format Paperback Subject Literary Collections Publisher Berlin Springer verlag 1979
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Mathematical Foundations of Computer Science 1979:...
Stock Image
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science, 74)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020158549
Stock Image
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science, 74)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540095262_new
Buy New
US$ 56.77
US$ 16.39 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783540095262
Buy New
US$ 54.39
US$ 21.19 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Stock Image
Mathematical Foundations of Computer Science 1979
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 596. Seller Inventory # 263063682
Seller Image
Mathematical Foundations of Computer Science 1979
Published by
Springer Berlin Heidelberg Jul 1979, 1979
ISBN 10: 3540095268
ISBN 13: 9783540095262
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540095262
Buy New
US$ 52.21
US$ 27.25 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Stock Image
Mathematical Foundations of Computer Science 1979
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: 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. Seller Inventory # 5832797
Buy New
US$ 72.52
US$ 8.89 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Seller Image
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science, 74, Band 74)
Seller: Studibuch, Stuttgart, Germany
Seller rating 5 out of 5 stars
paperback. Condition: Befriedigend. Seiten; 9783540095262.4 Gewicht in Gramm: 1. Seller Inventory # 688143
Buy Used
US$ 8.53
US$ 73.81 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Stock Image
Mathematical Foundations of Computer Science 1979
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 596. Seller Inventory # 183063688
Buy New
US$ 78.60
US$ 11.79 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 4 available
Seller Image
Mathematical Foundations of Computer Science 1979
Published by
Springer Berlin Heidelberg, 1979
ISBN 10: 3540095268
ISBN 13: 9783540095262
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: 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. Seller Inventory # 4880499
Buy New
US$ 48.33
US$ 58.04 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Mathematical Foundations of Computer Science 1979
Published by
Springer Berlin Heidelberg, J.B. Metzler Jul 1979, 1979
ISBN 10: 3540095268
ISBN 13: 9783540095262
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 596 pp. Englisch. Seller Inventory # 9783540095262
Buy New
US$ 52.21
US$ 71.08 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available