Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7775 3540133453 Sprache: Englisch Gewicht in Gramm: 900. N� de r�f. du vendeur 2347473

Contacter le vendeur

Acheter D'occasion

EUR 10,48

Autre devise

Frais de port : EUR 7

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

AUTOMATA, LANGUAGES, AND PROGRAMMING: 11TH COLLOQUIUM, ANTWERP, BELGIUM, JULY 16-20, 1984 (EATCS SIGN). PROCEEDINGS (LECTURE NOTES IN COMPUTER SCIENCE)

GOOS & HARTMANIS /PAREDAENS, JAN

Edit� par Springer, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Ancien ou d'occasion Paperback

Vendeur : Green Ink Booksellers, Hay-on-Wye, POWYS, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : Very Good. Nice clean bright tight book 527 pages. N� de r�f. du vendeur 569117

Contacter le vendeur

Acheter D'occasion

EUR 13,24

Autre devise

Frais de port : EUR 5,84

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages, and Programming

Paredaens, J.

Edit� par Springer Berlin Heidelberg, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Neuf Couverture souple

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur 4882153

Contacter le vendeur

Acheter neuf

EUR 45,74

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Automata, Languages, and Programming : 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings

J. Paredaens

Edit� par Springer Berlin Heidelberg, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 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). N� de r�f. du vendeur 9783540133452

Contacter le vendeur

Acheter neuf

EUR 50,28

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages, and Programming

J. Paredaens

Edit� par Springer Berlin Heidelberg Jun 1984, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - 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�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). 540 pp. Englisch. N� de r�f. du vendeur 9783540133452

Contacter le vendeur

Acheter neuf

EUR 50,28

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science, 172)

Paredaens, J.

Edit� par Springer, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783540133452_new

Contacter le vendeur

Acheter neuf

EUR 58,68

Autre devise

Frais de port : EUR 4,66

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Automata, Languages, and Programming : 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings

Paredaens, J.

Edit� par Springer 1984-06, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Neuf PF

Vendeur : Chiron Media, Wallingford, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

PF. Etat : New. N� de r�f. du vendeur 6666-IUK-9783540133452

Contacter le vendeur

Acheter neuf

EUR 53,06

Autre devise

Frais de port : EUR 11,09

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : 10 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages, and Programming

J. Paredaens

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1984, 1984

ISBN 10 : 3540133453 ISBN 13 : 9783540133452

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. 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�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).Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 540 pp. Englisch. N� de r�f. du vendeur 9783540133452

Contacter le vendeur