Artículos relacionados a Automata, Languages and Programming: Ninth Colloquium...
Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982: 140 (Lecture Notes in Computer Science) - Tapa blanda
Sinopsis
Japanese rare item
"Sinopsis" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación1982
- ISBN 10 3540115765
- ISBN 13 9783540115762
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas628
- EditorNielsen M., Schmidt E. M.
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 53,49
EUR 11,99 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Automata, Languages and Programming: Ninth Colloquium...
Imagen del vendedor
Automata, Languages and Programming. (=Lecture Notes in Computer Science 140).
Publicado por
Springer Berlin, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
Antiguo o usado
Tapa dura
Librería: ralfs-buecherkiste, Herzfelde, MOL, Alemania
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Gut. 613 Seiten Guter Zustand/ Good With figures and tables. Additional cover foliation. ha1045407 Sprache: Englisch Gewicht in Gramm: 1100. Nº de ref. del artículo: 229487
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming : Ninth Colloquium Aarhus, Denmark, July 12¿16, 1982
Publicado por
Springer Berlin Heidelberg, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
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 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. Nº de ref. del artículo: 9783540115762
Cantidad disponible: 1 disponibles
Imagen de archivo
Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982 (Lecture Notes in Computer Science, 140)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540115762_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 4881442
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1982, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
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 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 628 pp. Englisch. Nº de ref. del artículo: 9783540115762
Cantidad disponible: 1 disponibles
Imagen de archivo
Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12-16, 1982
Publicado por
Springer-Verlag New York Inc, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 1982 edition. 628 pages. 9.25x6.10x0.73 inches. In Stock. Nº de ref. del artículo: x-3540115765
Cantidad disponible: 2 disponibles
Imagen de archivo
Automata, Languages and Programming
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 108079466
Cantidad disponible: 4 disponibles
Imagen de archivo
Automata, Languages and Programming
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 628. Nº de ref. del artículo: 26101095093
Cantidad disponible: 4 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg Jul 1982, 1982
ISBN 10: 3540115765
ISBN 13: 9783540115762
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 9783540115762
Cantidad disponible: 2 disponibles
Imagen de archivo
Automata, Languages and Programming
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 628. Nº de ref. del artículo: 18101095103
Cantidad disponible: 4 disponibles