Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12–16, 1982: 140 (Lecture Notes in Computer Science, 140) - Softcover
Synopsis
Automata, Languages, and Programming: Ninth Colloquium, Aarhus, Denmark, July 12-16, 1982. Proceedings
"synopsis" may belong to another edition of this title.
Search results for Automata, Languages and Programming: Ninth Colloquium...
Stock Image
Automata, Languages and Programming (Paperback)
Published by
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783540115762
Stock Image
Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982 (Lecture Notes in Computer Science, 140)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540115762_new
Buy New
£ 50.43
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982 (Lecture Notes in Computer Science)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783540115762
Buy New
£ 48.03
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1982, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540115762
Stock Image
Automata, Languages and Programming
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 628. Seller Inventory # 26101095093
Stock Image
Automata, Languages and Programming
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: 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. Seller Inventory # 108079466
Buy New
£ 72.57
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982
Published by
Springer-Verlag New York Inc, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 1982 edition. 628 pages. 9.25x6.10x0.73 inches. In Stock. Seller Inventory # x-3540115765
Buy New
£ 70.02
£ 12.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Automata, Languages and Programming
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 628. Seller Inventory # 18101095103
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4881442
Buy New
£ 43.46
£ 42.74 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Automata, Languages and Programming
Published by
Springer, Springer Jul 1982, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540115762