Verwandte Artikel zu Mathematical Foundations of Computer Science 1979:...
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings: 74 (Lecture Notes in Computer Science) - Softcover
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
- VerlagSpringer
- Erscheinungsdatum2008
- ISBN 10 3540095268
- ISBN 13 9783540095262
- EinbandTapa blanda
- Anzahl der Seiten596
Neu kaufen
Mehr zu diesem Angebot erfahren
EUR 49,32
Versand:
EUR 11,66
Von Vereinigtes Königreich nach USA
Beste Suchergebnisse bei AbeBooks
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1979 : 8th Symposium; Olomouc Czechoslovakia; September 3-7; 1979. Proceedings
Print-on-Demand
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783540095262_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 49,32
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science (74)) by Becvar, J. [Paperback ]
Anbieter:
Bewertung
Buchbeschreibung Soft Cover. Zustand: new. Bestandsnummer des Verkäufers 9783540095262
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 61,51
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1979 : 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
Anbieter:
Bewertung
Buchbeschreibung PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540095262
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 44,71
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1979
Verlag:
Springer Berlin Heidelberg Jul 1979
(1979)
ISBN 10: 3540095268
ISBN 13: 9783540095262
Neu
Taschenbuch
Anzahl: 2
Anbieter:
Bewertung
Buchbeschreibung Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540095262
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 42,79
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1979: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings (Lecture Notes in Computer Science, 74)
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020158549
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 62,74
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1979
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. pp. 596. Bestandsnummer des Verkäufers 263063682
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 63,35
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1979
Print-on-Demand
Anbieter:
Bewertung
Buchbeschreibung Zustand: 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. Bestandsnummer des Verkäufers 5832797
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 67,02
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1979 : 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
Verlag:
Springer Berlin Heidelberg
(1979)
ISBN 10: 3540095268
ISBN 13: 9783540095262
Neu
Taschenbuch
Anzahl: 1
Anbieter:
Bewertung
Buchbeschreibung Taschenbuch. Zustand: 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 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. Bestandsnummer des Verkäufers 9783540095262
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 48,64
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1979
Verlag:
Springer Berlin Heidelberg
(1979)
ISBN 10: 3540095268
ISBN 13: 9783540095262
Neu
Softcover
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung Zustand: 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. Bestandsnummer des Verkäufers 4880499
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 39,60
Währung umrechnen