Verwandte Artikel zu Automata, Languages and Programming: 12th Colloquium,...
Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings: 194 (Lecture Notes in Computer Science) - Softcover
Gebraucht kaufen
Zustand: Gut bis sehr gutAncien livre de bibliothèque. Edition...
Diesen Artikel anzeigen
EUR 2,70
EUR 22,50 für den Versand von Frankreich nach USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 61,40
EUR 6,81 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerSuchergebnisse für Automata, Languages and Programming: 12th Colloquium,...
Beispielbild für diese ISBN
Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings
Verlag:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1985
ISBN 10: 354015650X
ISBN 13: 9783540156505
Gebraucht
Softcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Softcover. Zustand: Bon. Ancien livre de bibliothèque. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations. Bestandsnummer des Verkäufers E-571-012
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings (Lecture Notes in Computer Science)
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Very Good. 038715650X Ex-library paperback in very nice condition with the usual markings and attachments. Bestandsnummer des Verkäufers UTD14a2511
Anzahl: 1 verfügbar
Foto des Verkäufers
Automata, Languages and Programming. 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings.
Verlag:
Berlin, Springer Berlin Heidelberg, 1985
ISBN 10: 354015650X
ISBN 13: 9783540156505
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. so7773 354015650X Sprache: Englisch Gewicht in Gramm: 900. Bestandsnummer des Verkäufers 2347471
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings (Lecture Notes in Computer Science, 194)
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9783540156505
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings (Lecture Notes in Computer Science, 194)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540156505_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings (Lecture Notes in Computer Science, 194)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020160684
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Automata, Languages and Programming : 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540156505
Anzahl: 10 verfügbar
Foto des Verkäufers
Automata, Languages and Programming
Verlag:
Springer Berlin Heidelberg Jun 1985, 1985
ISBN 10: 354015650X
ISBN 13: 9783540156505
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Vertex packing algorithms.- Linear and branching structures in the semantics and logics of reactive systems.- About rational sets of factors of a bi-infinite word.- A fair protocol for signing contracts.- The influence of key length on the area-time complexity of sorting.- Repeated synchronous snapshots and their implementation in CSP.- On total regulators generated by derivation relations.- Optimal solutions for a class of point retrieval problems.- Fractional cascading: A data structuring technique with geometric applications.- Hierarchies of one-way multihead automata languages.- Partitioning point sets in 4 dimensions.- A completeness theorem for recursively defined types.- Categorical combinatory logic.- Towards a uniform topological treatment of streams and functions on streams.- Infinite streams and finite observations in the semantics of uniform concurrency.- Imposed-functional dependencies inducing horizontal decompositions.- Characterization of high level tree transducers.- Ambiguity and transcendence.- A fast algorithm for polygon containment by translation.- Deterministic and Las Vegas primality testing algorithms.- Efficient algorithms for graphic matroid intersection and parity.- Operational semantics for order-sorted algebra.- A universal domain technique for profinite posets.- A simple proof of the Skolem-Mahler-Lech theorem.- On complete problems for NP CoNP.- An algebraic theory of fair asynchronous communicating processes.- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem.- Powerdomains as algebraic lattices preliminary report.- Random generation of combinatiorial structures from a uniform distribution.- Do rational equivalence relations have regular cross-sections .- On probabilistic time and space.- The nearest neighbor problem on bounded domains.- Routing through a generalized switchbox.- On k-repetition free words generated by length uniform morphisms over a binary alphabet.- Every commutative quasirational language is regular.- A probabilistic distributed algorithm for set intersection and its analysis.- Distributed algorithms in synchronous broadcasting networks.- A context dependent equivalence between processes.- Lower bounds by kolmogorov-complexity.- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version).- Applications of an infinite squarefree CO-CFL.- Special relations in automated deduction.- Dynamic interpolation search.- Polynomial levelability and maximal complexity cores.- Finite group topology and p-adic topology for free monoids.- On the use of relational expressions in the design of efficient algorithms.- The complementation problem for B¿chi automata with applications to temporal logic.- A complete compositional modal proof system for a subset of CCS.- On matrix multiplication using array processors.- Optimal parallel pattern matching in strings.- Compositionality and concurrent networks: Soundness and completeness of a proofsystem. 536 pp. Englisch. Bestandsnummer des Verkäufers 9783540156505
Anzahl: 2 verfügbar
Foto des Verkäufers
Automata, Languages and Programming
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Vertex packing algorithms.- Linear and branching structures in the semantics and logics of reactive systems.- About rational sets of factors of a bi-infinite word.- A fair protocol for signing contracts.- The influence of key length on the area-time complex. Bestandsnummer des Verkäufers 4882692
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Automata, Languages and Programming
ISBN 10: 354015650X
ISBN 13: 9783540156505
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -Vertex packing algorithms.- Linear and branching structures in the semantics and logics of reactive systems.- About rational sets of factors of a bi-infinite word.- A fair protocol for signing contracts.- The influence of key length on the area-time complexity of sorting.- Repeated synchronous snapshots and their implementation in CSP.- On total regulators generated by derivation relations.- Optimal solutions for a class of point retrieval problems.- Fractional cascading: A data structuring technique with geometric applications.- Hierarchies of one-way multihead automata languages.- Partitioning point sets in 4 dimensions.- A completeness theorem for recursively defined types.- Categorical combinatory logic.- Towards a uniform topological treatment of streams and functions on streams.- Infinite streams and finite observations in the semantics of uniform concurrency.- Imposed-functional dependencies inducing horizontal decompositions.- Characterization of high level tree transducers.- Ambiguity and transcendence.- A fast algorithm for polygon containment by translation.- Deterministic and Las Vegas primality testing algorithms.- Efficient algorithms for graphic matroid intersection and parity.- Operational semantics for order-sorted algebra.- A universal domain technique for profinite posets.- A simple proof of the Skolem-Mahler-Lech theorem.- On complete problems for NP CoNP.- An algebraic theory of fair asynchronous communicating processes.- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem.- Powerdomains as algebraic lattices preliminary report.- Random generation of combinatiorial structures from a uniform distribution.- Do rational equivalence relations have regular cross-sections .- On probabilistic time and space.- The nearest neighbor problem on bounded domains.- Routing through a generalized switchbox.- On k-repetition free words generated by length uniform morphisms over a binary alphabet.- Every commutative quasirational language is regular.- A probabilistic distributed algorithm for set intersection and its analysis.- Distributed algorithms in synchronous broadcasting networks.- A context dependent equivalence between processes.- Lower bounds by kolmogorov-complexity.- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version).- Applications of an infinite squarefree CO-CFL.- Special relations in automated deduction.- Dynamic interpolation search.- Polynomial levelability and maximal complexity cores.- Finite group topology and p-adic topology for free monoids.- On the use of relational expressions in the design of efficient algorithms.- The complementation problem for B¿chi automata with applications to temporal logic.- A complete compositional modal proof system for a subset of CCS.- On matrix multiplication using array processors.- Optimal parallel pattern matching in strings.- Compositionality and concurrent networks: Soundness and completeness of a proofsystem.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 536 pp. Englisch. Bestandsnummer des Verkäufers 9783540156505
Anzahl: 2 verfügbar