Items related to 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, 194) - Softcover

 
9783540156505: Automata, Languages and Programming: 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings: 194 (Lecture Notes in Computer Science, 194)

Synopsis

No Automata, Languages, and Programming Read a customer review or write one .

"synopsis" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date1985
  • ISBN 10 354015650X
  • ISBN 13 9783540156505
  • BindingPaperback
  • LanguageEnglish
  • Number of pages536
  • EditorBrauer Wilfried

Buy Used

Condition: Near Fine
Ancien livre de bibliothèque. Edition...
View this item

£ 6.81 shipping from France to United Kingdom

Destination, rates & speeds

Buy New

View this item

£ 2.49 shipping within United Kingdom

Destination, rates & speeds

Search results for Automata, Languages and Programming: 12th Colloquium,...

Stock Image

Wilfried Brauer
ISBN 10: 354015650X ISBN 13: 9783540156505
Used Softcover

Seller: Ammareal, Morangis, France

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Softcover. Condition: 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. Seller Inventory # E-571-012

Contact seller

Buy Used

£ 29.26
Convert currency
Shipping: £ 6.81
From France to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Brauer, Wilfried:
ISBN 10: 354015650X ISBN 13: 9783540156505
Used Softcover

Seller: Antiquariat Bookfarm, Löbnitz, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

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. Seller Inventory # 2347471

Contact seller

Buy Used

£ 35.22
Convert currency
Shipping: £ 5.96
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Brauer, Wilfried
Published by Springer 1985-06, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
New PF

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PF. Condition: New. Seller Inventory # 6666-IUK-9783540156505

Contact seller

Buy New

£ 44.07
Convert currency
Shipping: £ 2.49
Within United Kingdom
Destination, rates & speeds

Quantity: 10 available

Add to basket

Stock Image

Published by Springer, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
New Softcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9783540156505_new

Contact seller

Buy New

£ 48.74
Convert currency
Shipping: FREE
Within United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Wilfried Brauer
ISBN 10: 354015650X ISBN 13: 9783540156505
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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. Seller Inventory # 9783540156505

Contact seller

Buy New

£ 44.10
Convert currency
Shipping: £ 9.37
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Wilfried Brauer
Published by Springer Berlin Heidelberg, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540156505

Contact seller

Buy New

£ 44.10
Convert currency
Shipping: £ 11.91
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Brauer, Wilfried
Published by Springer Berlin Heidelberg, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: 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. Seller Inventory # 4882692

Contact seller

Buy New

£ 40.12
Convert currency
Shipping: £ 21.28
From Germany to United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Wilfried Brauer
ISBN 10: 354015650X ISBN 13: 9783540156505
New Taschenbuch

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: 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. Seller Inventory # 9783540156505

Contact seller

Buy New

£ 44.10
Convert currency
Shipping: £ 29.80
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Brauer, Wilfried [Editor]
Published by Springer, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
Used Paperback

Seller: GuthrieBooks, Spring Branch, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: Very Good. 038715650X Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # UTD14a2511

Contact seller

Buy Used

£ 44.17
Convert currency
Shipping: £ 55.28
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Published by Springer, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar3113020160684

Contact seller

Buy New

£ 57.34
Convert currency
Shipping: £ 55.28
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket