nielsen m schmidt e m (21 resultados)

Condición: Good. *Price HAS BEEN REDUCED by 10% until Monday, June 29 (SALE item)* 613 pp., paperback, ex library, else textually clean and tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Paperback. Condición: new. Paperback. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condición: New. In.

Paperback. Condición: New.

Condición: New. pp. 628.

Paperback. Condición: Brand New. 1982 edition. 628 pages. 9.25x6.10x0.73 inches. In Stock.

Taschenbuch. Condición: 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.

Hardcover. Condición: Gut. 613 Seiten Guter Zustand/ Good With figures and tables. Additional cover foliation. ha1045407 Sprache: Englisch Gewicht in Gramm: 1100.

Taschenbuch. Condición: Neu. Automata, Languages and Programming | Ninth Colloquium Aarhus, Denmark, July 12-16, 1982 | M. Nielsen (u. a.) | Taschenbuch | vii | Englisch | 1982 | Springer | EAN 9783540115762 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condición: new. Paperback. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Paperback. Condición: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Softcover. Condición: gut. Auflage: 2006 (27. März 2006). Co-Branding Corporate Identity Wirtschaft Betriebswirtschaft Kommunikationseffizienz Kommunikationsmodelle Kommunikationstraining Unternehmensidentität Unternehmenskommunikation Unternehmenskommunikation Optimierung von Kommunikationsabläufen inner- und außerhalb von Unternehmen Fallstudien und Lösungskonzepte Interpretations- und Transferprobleme im interkulturellen Kontext; internationale Wirtschaftskontakte Mediation Investor Relations Co-Branding Wertvorstellungen und Überzeugungsarbeit in Werbeauftritten Trainingskonzepte Konfliktbearbeitung Unternehmenskommunikation interdisziplinär betrachtet. Zentrales Thema des Bandes ist die Optimierung von Kommunikationsabläufen inner- und außerhalb von Unternehmen. Es werden Fallstudien und Lösungskonzepte zu folgenden Themenbereichen vorgestelltInterpretations- und Transferprobleme im interkulturellen Kontext; internationale Wirtschaftskontakte (Mediation, Investor Relations, Co-Branding); Wertvorstellungen und Überzeugungsarbeit in Werbeauftritten; Trainingskonzepte (Konfliktbearbeitung). Drs. Rogier Crijns ist Associate Professor am Department of Business Communication der Radboud Universität Nijmegen, Niederlande. Janine Thalheim ist wissenschaftliche Hilfskraft bei Drs. Rogier Crijns am Department of Business Communication der Radboud Universität Nijmegen, Niederlande. In deutscher Sprache. 354 pages. 21 x 14,6 x 1,8 cm.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: 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.

Condición: 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.

Condición: New. PRINT ON DEMAND pp. 628.

Condición: 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.

Taschenbuch. Condición: 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.