Automata, Languages, and Programming - 11 Angebote vergleichen

Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, NDS, Germany.
This item is printed on demand - Print on Demand Titel. Neuware - 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 multiplier with 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). 540 pp. Englisch.

Lieferung aus: Deutschland, Lieferbar in 2 - 3 Tage.
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 multiplier with 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¿es facteurs des mots infinis engendr¿par morphismes it¿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). Taschenbuch, 01.06.1984.

Lieferung aus: Vereinigte Staaten von Amerika, zzgl. Versandkosten, Verandgebiet: DOM.
Von Händler/Antiquariat, Zubal Books, OH, Cleveland, [RE:5].
[viii], 527 pp., ex library, but text and binding still clean and tight, softcover. Trade paperback.

Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Zubal Books.
Berlin, 1984. [viii], 527 pp., ex library, but text and binding still clean and tight, softcover.

Von Händler/Antiquariat, Herb Tandree Philosophy Books [17426], Stroud, GLOS, United Kingdom.
9783540133452 Paperback, This listing is a new book, a title currently in-print which we order directly and immediately from the publisher.

Lieferung aus: Vereinigte Staaten von Amerika, zzgl. Versandkosten, Free Shipping on eligible orders over $25, in-stock.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Ergodebooks.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Von Händler/Antiquariat, Lawrence's Books [36203], Torrance, CA, U.S.A.
Very good ex-library (Caltech) softcover. Binding tight. Text very good. Usual library markings.

Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
x, 530 S. X, 530 p.Versandfertig in 3-5 Tagen, Softcover.

Lieferung aus: Vereinigte Staaten von Amerika, zzgl. Versandkosten, Verandgebiet: DOM.
Von Händler/Antiquariat, 2011, CA, Danville, [RE:4].
Trade paperback.