Mathematical foundations computer science von becvar (8 Ergebnisse)
- Softcover
Anbieter: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Vereinigtes KönigreichHay-on-Wye Booksellers
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Befriedigend
EUR 6,39
EUR 29,20 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
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.
- Weitere Bilder
- Softcover
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschlandbooks4less (Versandantiquariat Petra Gros GmbH & Co. KG)
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 24,95
EUR 15,95 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
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 Gewic…ht in Gramm: 730.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 50,03
EUR 13,99 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 61,12
EUR 13,99 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 83,63
EUR 14,60 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Paperback. Zustand: Brand New. 1975 edition. 484 pages. 9.30x6.50x0.90 inches. In Stock.
- Weitere Bilder
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 42,79
EUR 64,45 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
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 r…epresentations 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.
- Weitere Bilder
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 64,24 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
- Weitere Bilder
- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 50,40
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Mathematical Foundations of Computer Science 1975 | 4th Symposium Marianske Lazne, September 1-5, 1975 | J. Becvar | Taschenbuch | x | Englisch | Springer | EAN 9783540073895 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer…[dot]com | Anbieter: preigu.
