Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12?16, 1982 (Lecture Notes in Computer Science, 140)

ISBN 10: 3540115765 ISBN 13: 9783540115762

Edit� par Springer, 1982

Neuf(s) Couverture souple

Vendeur Ria Christie Collections, Uxbridge, Royaume-Uni �valuation du vendeur 5 sur 5 �toiles

Vendeur AbeBooks depuis 25 mars 2015

Cet article sp�cifique n'est plus disponible.

Afficher tous les articles du vendeur Cr�er une demande de livres portant sur des articles similaires

Afficher tous les exemplaires de ce livre

A propos de cet article

In. N� de r�f. du vendeur ria9783540115762_new

Signaler cet article

Synopsis :

Japanese rare item

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

D�tails bibliographiques

Titre : Automata, Languages and Programming: Ninth ...
�diteur : Springer
Date d'�dition : 1982
Reliure : Couverture souple
Etat : New

Meilleurs r�sultats de recherche sur AbeBooks

Image fournie par le vendeur

Automata, Languages and Programming. (=Lecture Notes in Computer Science 140).

Schmidt, E. M.:

Edit� par Springer Berlin, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Ancien ou d'occasion Couverture rigide

Vendeur : ralfs-buecherkiste, Herzfelde, MOL, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : Gut. 613 Seiten Guter Zustand/ Good With figures and tables. Additional cover foliation. ha1045407 Sprache: Englisch Gewicht in Gramm: 1100. N� de r�f. du vendeur 229487

Contacter le vendeur

Acheter D'occasion

EUR 15

Exp�dition �EUR 105
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming

Nielsen, M.|Schmidt, E. M.

Edit� par Springer Berlin Heidelberg, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Locality in modular systems.- On-the-fly garbage collection: New algorithms inspired by program proofs.- Algebraic specifications for parametrized data types with minimal parameter and target algebras.- A modification of the ?-calculus as a base for functio. N� de r�f. du vendeur 4881442

Contacter le vendeur

Acheter neuf

EUR 48,37

Exp�dition �EUR 48,99
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Autres images

Automata, Languages and Programming | Ninth Colloquium Aarhus, Denmark, July 12-16, 1982

M. Nielsen (u. a.)

Edit� par Springer, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Taschenbuch

Vendeur : preigu, Osnabr�ck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Contacter le vendeur

Acheter neuf

EUR 50,25

Exp�dition �EUR 70
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming : Ninth Colloquium Aarhus, Denmark, July 12-16, 1982

M. Nielsen

Edit� par Springer, Springer, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

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 - Locality in modular systems.- On-the-fly garbage collection: New algorithms inspired by program proofs.- Algebraic specifications for parametrized data types with minimal parameter and target algebras.- A modification of the -calculus as a base for functional programming languages.- On the power of nondeterminism in dynamic logic.- Equivalence and membership problems for regular trace languages.- On the power of chain rules in context free grammars.- Extended Chomsky-Sch�tzenberger theorems.- Real time agents.- Machine inductive inference and language identification.- Approximations of infinitary objects.- On test sets and the Ehrenfeucht conjecture.- An automata-theoretic characterization of the OI-hierarchy.- Fast detection of polyhedral intersections.- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store.- Multihead finite state automata am concatenation.- Conditions enforcing regularity of context-free languages.- Repetitions in homomorphisms and languages.- Parameter passing commutes with implementation of parameterized data types.- An operational semantics for pure dataflow.- Some properties of D-continuous causal nets.- A branching process arising in dynamic hashing, trie searching and polynomial factorization.- A sound and complete HOARE axiomatization of the ADA-rendezvous.- Universal realization, persistent interconnection and implementation of abstract modules.- Heaps on heaps.- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties.- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems.- A programming language for the inductive sets, and applications.- A lower bound for the formula size of rational functions.- On theequivalence problem for binary DOL systems.- Results on the propositional -calculus.- An iteration theorem for simple precedence languages.- The power of non-rectilinear holes.- Fixed-point semantics for algebraic (tree) grammars.- Completing biprefix codes.- Advances in pebbling.- A powerdomain for countable non-determinism.- Properties of a notation for combining functions.- On the power of probabilistic choice in synchronous parallel computations.- Biprefix codes and semisimple algebras.- Algorithmic theories of data structures.- Implementation of parameterised specifications.- Algebraic semantics of recursive flowchart schemes.- The complexity of promise problems.- Global and local invariants in transition systems.- On relativization and the existence of complete sets.- Semantics of interference control.- Efficient simulations of multicounter machines.- Event structure semantics for CCS and related languages.- Domains for denotational semantics. N� de r�f. du vendeur 9783540115762

Contacter le vendeur

Acheter neuf

EUR 53,49

Exp�dition �EUR 64,69
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming

E. M. Schmidt

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1982, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

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 -Locality in modular systems.- On-the-fly garbage collection: New algorithms inspired by program proofs.- Algebraic specifications for parametrized data types with minimal parameter and target algebras.- A modification of the -calculus as a base for functional programming languages.- On the power of nondeterminism in dynamic logic.- Equivalence and membership problems for regular trace languages.- On the power of chain rules in context free grammars.- Extended Chomsky-Sch�tzenberger theorems.- Real time agents.- Machine inductive inference and language identification.- Approximations of infinitary objects.- On test sets and the Ehrenfeucht conjecture.- An automata-theoretic characterization of the OI-hierarchy.- Fast detection of polyhedral intersections.- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store.- Multihead finite state automata am concatenation.- Conditions enforcing regularity of context-free languages.- Repetitions in homomorphisms and languages.- Parameter passing commutes with implementation of parameterized data types.- An operational semantics for pure dataflow.- Some properties of D-continuous causal nets.- A branching process arising in dynamic hashing, trie searching and polynomial factorization.- A sound and complete HOARE axiomatization of the ADA-rendezvous.- Universal realization, persistent interconnection and implementation of abstract modules.- Heaps on heaps.- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties.- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems.- A programming language for the inductive sets, and applications.- A lower bound for the formula size of rational functions.- On the equivalence problem for binary DOL systems.- Results on the propositional -calculus.- An iteration theorem for simple precedence languages.- The power of non-rectilinear holes.- Fixed-point semantics for algebraic (tree) grammars.- Completing biprefix codes.- Advances in pebbling.- A powerdomain for countable non-determinism.- Properties of a notation for combining functions.- On the power of probabilistic choice in synchronous parallel computations.- Biprefix codes and semisimple algebras.- Algorithmic theories of data structures.- Implementation of parameterised specifications.- Algebraic semantics of recursive flowchart schemes.- The complexity of promise problems.- Global and local invariants in transition systems.- On relativization and the existence of complete sets.- Semantics of interference control.- Efficient simulations of multicounter machines.- Event structure semantics for CCS and related languages.- Domains for denotational semantics. 628 pp. Englisch. N� de r�f. du vendeur 9783540115762

Contacter le vendeur

Acheter neuf

EUR 53,49

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming

M. Nielsen

Edit� par Springer, Springer Jul 1982, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Locality in modular systems.- On-the-fly garbage collection: New algorithms inspired by program proofs.- Algebraic specifications for parametrized data types with minimal parameter and target algebras.- A modification of the -calculus as a base for functional programming languages.- On the power of nondeterminism in dynamic logic.- Equivalence and membership problems for regular trace languages.- On the power of chain rules in context free grammars.- Extended Chomsky-Sch�tzenberger theorems.- Real time agents.- Machine inductive inference and language identification.- Approximations of infinitary objects.- On test sets and the Ehrenfeucht conjecture.- An automata-theoretic characterization of the OI-hierarchy.- Fast detection of polyhedral intersections.- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store.- Multihead finite state automata am concatenation.- Conditions enforcing regularity of context-free languages.- Repetitions in homomorphisms and languages.- Parameter passing commutes with implementation of parameterized data types.- An operational semantics for pure dataflow.- Some properties of D-continuous causal nets.- A branching process arising in dynamic hashing, trie searching and polynomial factorization.- A sound and complete HOARE axiomatization of the ADA-rendezvous.- Universal realization, persistent interconnection and implementation of abstract modules.- Heaps on heaps.- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties.- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems.- A programming language for the inductive sets, and applications.- A lower bound for the formula size of rational functions.- On theequivalence problem for binary DOL systems.- Results on the propositional -calculus.- An iteration theorem for simple precedence languages.- The power of non-rectilinear holes.- Fixed-point semantics for algebraic (tree) grammars.- Completing biprefix codes.- Advances in pebbling.- A powerdomain for countable non-determinism.- Properties of a notation for combining functions.- On the power of probabilistic choice in synchronous parallel computations.- Biprefix codes and semisimple algebras.- Algorithmic theories of data structures.- Implementation of parameterised specifications.- Algebraic semantics of recursive flowchart schemes.- The complexity of promise problems.- Global and local invariants in transition systems.- On relativization and the existence of complete sets.- Semantics of interference control.- Efficient simulations of multicounter machines.- Event structure semantics for CCS and related languages.- Domains for denotational semantics.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 628 pp. Englisch. N� de r�f. du vendeur 9783540115762

Contacter le vendeur

Acheter neuf

EUR 53,49

Exp�dition �EUR 60
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982 (Lecture Notes in Computer Science)

M. Nielsen, E. M. Schmidt

Edit� par Springer 1982-07-01, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Paperback

Vendeur : Chiron Media, Wallingford, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : New. N� de r�f. du vendeur 6666-IUK-9783540115762

Contacter le vendeur

Acheter neuf

EUR 57,06

Exp�dition �EUR 17,87
Exp�dition depuis Royaume-Uni vers Etats-Unis

Quantit� disponible : 10 disponible(s)

Ajouter au panier

Image d'archives

Automata, Languages and Programming (Paperback)

M. Nielsen

Edit� par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Paperback

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : new. Paperback. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N� de r�f. du vendeur 9783540115762

Contacter le vendeur

Acheter neuf

EUR 64,62

Livraison gratuite
Exp�dition nationale�: Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Automata, Languages and Programming

Edit� par Springer, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Couverture souple

impression � la demande

Vendeur : Majestic Books, Hounslow, Royaume-Uni

�valuation du vendeur 4 sur 5 �toiles

Etat : New. Print on Demand pp. 628 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N� de r�f. du vendeur 108079466

Contacter le vendeur

Acheter neuf

EUR 82,40

Exp�dition �EUR 7,50
Exp�dition depuis Royaume-Uni vers Etats-Unis

Quantit� disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982

Nielsen, M. (Editor)/ Schmidt, E. M. (Editor)

Edit� par Springer-Verlag New York Inc, 1982

ISBN 10 : 3540115765 ISBN 13 : 9783540115762

Neuf Paperback

Vendeur : Revaluation Books, Exeter, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : Brand New. 1982 edition. 628 pages. 9.25x6.10x0.73 inches. In Stock. N� de r�f. du vendeur x-3540115765

Contacter le vendeur

Acheter neuf

EUR 82,94

Exp�dition �EUR 14,42
Exp�dition depuis Royaume-Uni vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

There are 4 autres exemplaires de ce livre sont disponibles

Afficher tous les r�sultats pour ce livre

Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12?16, 1982 (Lecture Notes in Computer Science, 140)

A propos de cet article

Description :

Synopsis :

D�tails bibliographiques

Meilleurs r�sultats de recherche sur AbeBooks

Acheter D'occasion

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

Acheter neuf

There are 4 autres exemplaires de ce livre sont disponibles