Articoli correlati a Foundations of Computation Theory: Proceedings of the...
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983: 158 - Brossura
Contenuti
Experiments, powerdomains and fully abstract models for applicative multiprogramming.- Deterministic dynamic logic of recursive programs is weaker than dynamic logic.- Reversal-bounded and visit-bounded realtime computations.- Input-driven languages are recognized in log n space.- How to search in history.- Comstructive matnkmatics as a programming logic I: Some principles of theory.- The classification of problems which have fast parallel algorithms.- A fair calculus of communicating systems.- Two way finite state generators.- A complete set of axioms for a theory of communicating sequential processes.- The consensus problem in unreliable distributed systems (a brief survey).- Methods in the analysis of algorithms : Evaluations of a recursive partitioning process.- Space and reversal complexity of probabilistic one-way turing machines.- Pseudorandom number generation and space complexity.- Recurring dominoes: Making the highly undecidable highly understandable (preliminary report).- Propositional dynamic logic of flowcharts.- Fast triangulation of simple polygons.- On containment problems for finite-turn languages.- On languages generated by semigroups.- Aspects of programs with finite modes.- Estimating a probability using finite memory.- The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete.- Decision problems for exponential rings: The p-adic case.- Functional behavior of nondeterministic programs.- A single source shortest path algorithm for graphs with separators.- Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus).- Finding dominators.- Characterizing composability of abstract implementations.- Propositional logics of programs: New directions.- A new probabilistic model for the study of algorithmic properties of random graph problems.- On diagonalization methods and the structure of language classes.- A new solution for the Byzantine generals problem.- Modular decomposition of automata (survey).- A kernel language for algebraic specification and implementation extended abstract.- A fast construction of disjoint paths in communication networks.- A tight ?(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions.- The identification of propositions and types in Martin-Löf's type theory: A programming example.- Remarks on searching labyrinths by automata.- Metrical and ordered properties of powerdomains.- Economy of description for program schemes extended abstract.- On approximate string matching.- Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs.- A note on powerdomains and modality.- Reasoning with fairness constraints.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 3540126899
- ISBN 13 9783540126898
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine536
Compra nuovo
Visualizza questo articolo
EUR 69,13
EUR 3,55 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Foundations of Computation Theory: Proceedings of the...
Foto dell'editore
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983 (Lecture Notes in Computer Science)
Da: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. *Price HAS BEEN REDUCED by 10% until Monday, May 12 (weekend sale item)* 514 pp., Paperback, ex library, spine and joints worn, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Codice articolo ZB695784
Quantità: 1 disponibili
Immagini fornite dal venditore
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983 (Lecture Notes in Computer Science)
Da: Jonathan Grobe Books, Deep River, IA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Good. Exlibrary with usual library markings. Page yellowing. ; 514 pages. Codice articolo 281178
Quantità: 1 disponibili
Immagini fornite dal venditore
Foundations of Computation Theory. Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983.
Editore:
Berlin, Springer Berlin Heidelberg, 1983
ISBN 10: 3540126899
ISBN 13: 9783540126898
Antico o usato
Brossura
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7768 3540126899 Sprache: Englisch Gewicht in Gramm: 900. Codice articolo 2347466
Quantità: 1 disponibili
Foto dell'editore
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983 (Lecture Notes in Computer Science)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Codice articolo UTD14a-0851
Quantità: 1 disponibili
Foto dell'editore
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983 (Lecture Notes in Computer Science, 158)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020159904
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Foundations of Computation Theory
Editore:
Springer Berlin Heidelberg Aug 1983, 1983
ISBN 10: 3540126899
ISBN 13: 9783540126898
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Experiments, powerdomains and fully abstract models for applicative multiprogramming.- Deterministic dynamic logic of recursive programs is weaker than dynamic logic.- Reversal-bounded and visit-bounded realtime computations.- Input-driven languages are recognized in log n space.- How to search in history.- Comstructive matnkmatics as a programming logic I: Some principles of theory.- The classification of problems which have fast parallel algorithms.- A fair calculus of communicating systems.- Two way finite state generators.- A complete set of axioms for a theory of communicating sequential processes.- The consensus problem in unreliable distributed systems (a brief survey).- Methods in the analysis of algorithms : Evaluations of a recursive partitioning process.- Space and reversal complexity of probabilistic one-way turing machines.- Pseudorandom number generation and space complexity.- Recurring dominoes: Making the highly undecidable highly understandable (preliminary report).- Propositional dynamic logic of flowcharts.- Fast triangulation of simple polygons.- On containment problems for finite-turn languages.- On languages generated by semigroups.- Aspects of programs with finite modes.- Estimating a probability using finite memory.- The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete.- Decision problems for exponential rings: The p-adic case.- Functional behavior of nondeterministic programs.- A single source shortest path algorithm for graphs with separators.- Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus).- Finding dominators.- Characterizing composability of abstract implementations.- Propositional logics of programs: New directions.- A new probabilistic model for the study of algorithmic properties of random graph problems.- On diagonalization methods and the structure of language classes.- A new solution for the Byzantine generals problem.- Modular decomposition of automata (survey).- A kernel language for algebraic specification and implementation extended abstract.- A fast construction of disjoint paths in communication networks.- A tight (loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions.- The identification of propositions and types in Martin-L¿f's type theory: A programming example.- Remarks on searching labyrinths by automata.- Metrical and ordered properties of powerdomains.- Economy of description for program schemes extended abstract.- On approximate string matching.- Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs.- A note on powerdomains and modality.- Reasoning with fairness constraints. 536 pp. Englisch. Codice articolo 9783540126898
Quantità: 2 disponibili
Foto dell'editore
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983 (Lecture Notes in Computer Science, 158)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540126898_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Foundations of Computation Theory : Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983
Editore:
Springer Berlin Heidelberg, 1983
ISBN 10: 3540126899
ISBN 13: 9783540126898
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Experiments, powerdomains and fully abstract models for applicative multiprogramming.- Deterministic dynamic logic of recursive programs is weaker than dynamic logic.- Reversal-bounded and visit-bounded realtime computations.- Input-driven languages are recognized in log n space.- How to search in history.- Comstructive matnkmatics as a programming logic I: Some principles of theory.- The classification of problems which have fast parallel algorithms.- A fair calculus of communicating systems.- Two way finite state generators.- A complete set of axioms for a theory of communicating sequential processes.- The consensus problem in unreliable distributed systems (a brief survey).- Methods in the analysis of algorithms : Evaluations of a recursive partitioning process.- Space and reversal complexity of probabilistic one-way turing machines.- Pseudorandom number generation and space complexity.- Recurring dominoes: Making the highly undecidable highly understandable (preliminary report).- Propositional dynamic logic of flowcharts.- Fast triangulation of simple polygons.- On containment problems for finite-turn languages.- On languages generated by semigroups.- Aspects of programs with finite modes.- Estimating a probability using finite memory.- The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete.- Decision problems for exponential rings: The p-adic case.- Functional behavior of nondeterministic programs.- A single source shortest path algorithm for graphs with separators.- Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus).- Finding dominators.- Characterizing composability of abstract implementations.- Propositional logics of programs: New directions.- A new probabilistic model for the study of algorithmic properties of random graph problems.- On diagonalization methods and the structure of language classes.- A new solution for the Byzantine generals problem.- Modular decomposition of automata (survey).- A kernel language for algebraic specification and implementation extended abstract.- A fast construction of disjoint paths in communication networks.- A tight (loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions.- The identification of propositions and types in Martin-L¿f's type theory: A programming example.- Remarks on searching labyrinths by automata.- Metrical and ordered properties of powerdomains.- Economy of description for program schemes extended abstract.- On approximate string matching.- Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs.- A note on powerdomains and modality.- Reasoning with fairness constraints. Codice articolo 9783540126898
Quantità: 1 disponibili
Immagini fornite dal venditore
Foundations of Computation Theory
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Experiments, powerdomains and fully abstract models for applicative multiprogramming.- Deterministic dynamic logic of recursive programs is weaker than dynamic logic.- Reversal-bounded and visit-bounded realtime computations.- Input-driven languages are rec. Codice articolo 4881895
Quantità: Più di 20 disponibili
Foto dell'editore
Foundations of Computation Theory: Proceedings of the 1983 International FCT-Conference Borgholm, Sweden, August 21-27, 1983 (Lecture Notes in Computer Science, 158)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Very Good. Very Good. book. Codice articolo ERICA79035401268996
Quantità: 1 disponibili