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.

Descrizione libreria

Hello! Ria Christie Collections is an online venture that was initially set up in 2012 to sell books. We do not have a physical high street store. We are professional online booksellers. We only sell brand new books in perfect condition that we source from various suppliers and the publishers. Primarily, our aim is to provide an excellent service to all our customers. We always work as a team to achieve this. Our other objectives are to: 1. Ensure that all our products reach their destination quickly in a safe and secure manner 2. Answer to all our customer queries within 24 hours 3. Ensure that our customers are happy with their purchases 4. Provide all the items at a competitive price 5. Always listen to our customers Ria Christie Collections is not a registered company. It is a Sole Trader venture. Other key information is shown below: Contact Person Name: Rakesh Luchmun (Mr) Storefront Name: Ria Christie Collections Place of Establishment Address: Suite B; ARUN House; ARUN Building Arundel Road Uxbridge UB8 2RR United Kingdom E-Mail Address: riachristie@hotmail.co.uk VAT Number: GB 160 5650 25 We always work hard and aim to comply with all of Abebooks Policies. If you have any issues, please do not hesitate to write to us whether before or after a purchase. We promise to reply to you promptly and, in any case, within 24 hours. Thank you kindly! Yours sincerely Mr Rakesh Luchmun (Founder) and the Ria Christie Collections Team

Visita la pagina della libreria

Informazioni sull?azienda del venditore

Ryefield Investments Limited
175 Pield Heath Road, Uxbridge, UB8 3NL, United Kingdom

Condizioni di vendita:

All Returns and Refund are as per Abebooks policies.

Condizioni di spedizione:

Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!

Metodi di pagamento
accettati dalla libreria

Aggiungi ai desiderata

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 (Lecture Notes in Computer Science, 158)

Nuovi - Brossura

Informazioni sull?azienda del venditore