Automata Languages Programming 11th (6 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 48.75
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 45.89
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
Paperback. Condition: New.
Published by Springer verlag, Berlin, 1984
- Softcover
Seller: L'ivre d'Histoires, Merbes Sainte Marie, BelgiumL'ivre d'Histoires
Contact seller5-star sellerCondition: Used - Near fine
£ 17.60
£ 32.89 shippingShips from Belgium to U.S.A.Quantity: 1 available
Add to basketCouverture souple. Condition: Bon. Collection "Lecture notes in computer science", n°172, 527 pages, petit cachet de propriétaire en page de titre.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 44.25
£ 54.72 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The theory of data dependencies - An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database… relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplierwith minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexité des facteurs des mots infinis engendrés par morphismes itérés.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP - like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract).
Language: English
Published by Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg, 1984
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 85.31
£ 20.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 1984 edition. 535 pages. 9.25x6.10x1.22 inches. In Stock.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 41.80
£ 59.81 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Automata, Languages, and Programming | 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings | J. Paredaens | Taschenbuch | x | Englisch | 1984 | Springer | EAN 9783540133452 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juerge…n[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
