Verwandte Artikel zu Automata, Languages, and Programming: 11th Colloquium,...
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings: 172 (Lecture Notes in Computer Science) - Softcover
Inhaltsangabe
Autómatas, idiomas y programación: 11º Coloquio, Amberes, Bélgica, 16-20 de julio de 1984 (signo Eatcs). Proceedings Automata, Languages and Programming: 11º Coloquio, Amberes, Bélgica, 16-20 de julio de 1984 (Eatcs Sign). Procedimientos
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2008
- ISBN 10 3540133453
- ISBN 13 9783540133452
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten540
- Kontakt zum HerstellerNicht verfügbar
Neu kaufen
Diesen Artikel anzeigen
EUR 45,74
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Automata, Languages, and Programming: 11th Colloquium,...
Foto des Verkäufers
Automata, Languages, and Programming. 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings.
Verlag:
Berlin, Springer Berlin Heidelberg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Gebraucht
Softcover
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Artikel-Nr. 2347473
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
AUTOMATA, LANGUAGES, AND PROGRAMMING: 11TH COLLOQUIUM, ANTWERP, BELGIUM, JULY 16-20, 1984 (EATCS SIGN). PROCEEDINGS (LECTURE NOTES IN COMPUTER SCIENCE)
Anbieter: Green Ink Booksellers, Hay-on-Wye, POWYS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Very Good. Nice clean bright tight book 527 pages. Artikel-Nr. 569117
Anzahl: 1 verfügbar
Foto des Verkäufers
Automata, Languages, and Programming
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Artikel-Nr. 4882153
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Automata, Languages, and Programming
ISBN 10: 3540133453
ISBN 13: 9783540133452
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Artikel-Nr. 9783540133452
Anzahl: 2 verfügbar
Foto des Verkäufers
Automata, Languages, and Programming : 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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). Artikel-Nr. 9783540133452
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science, 172)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9783540133452_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (Eatcs Sign). Proceedings
Verlag:
Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Neu
Paperback
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 1984 edition. 535 pages. 9.25x6.10x1.22 inches. In Stock. Artikel-Nr. x-3540133453
Anzahl: 2 verfügbar