Automata, Languages and Programming: Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981: 115 (Lecture Notes in Computer Science) - Tapa blanda
Resultados de la búsqueda para Automata, Languages and Programming: Eighth Colloquium,...
Imagen de archivo
Automata, Languages and Programming: Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 (Lecture Notes in Computer Science, 115)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020159141
Comprar nuevo
EUR 53,28
Gastos de envío:
EUR 3,42
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Automata, Languages and Programming: Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 (Lecture Notes in Computer Science, 115)
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: ria9783540108436_new
Comprar nuevo
EUR 57,64
Gastos de envío:
EUR 13,65
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1981, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
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 -Refined analysis and improvements on some factoring algorithms.- Absolute primality of polynomials is decidable in random polynomial time in the number of variables.- Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform.- Cost tradeoffs in graph embeddings, with applications.- Minimum s-t cut of a planar undirected network in o(n log2(n)) time.- On the density of color-families.- The implication problem for data dependencies.- Characterizing data base Dependencies.- Data flow analysis of applicative programs.- Flow analysis of lambda expressions.- Algorithmic specifications of abstract data types.- Nondeterminism in abstract data types.- A view of directions in relational database theory.- A new characterization of the regular languages.- Langages Reconnaissables et Codage Prefixe Pur.- Passes, sweeps and visits.- On LALR(k) testing.- On size bounds for deterministic parsers.- A decision procedure for the equivalence of two dpdas one of which is linear.- The deducibility problem in Propositional Dynamic Logic.- Finite models for deterministic propositional dynamic logic.- Impartiality, justice and fairness: The ethics of concurrent termination.- Computing a perfect strategy for n¿ chess requires time exponential in n.- On the complexity of simple arithmetic expressions.- Proving lower bounds for linear decision trees.- Parikh-bounded languages.- Generalized Parikh mappings and homomorphisms.- Chomsky-Schotzenberger representations for families of languages and grammatical types.- Algebraically specified programming systems and Hoare's logic.- Automatic construction of verification condition generators from hoare logics.- Circular expressions: Elimination of static environments.- An axiomatic approach to the Korenjak - Hopcroft algorithms.- On the (generalized) post correspondence problem with lists of length 2.- A sparse table implementation of priority queues.- Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems.- Termination of linear rewriting systems.- Realizing an equational specification.- A cook's tour of countable nondeterminism.- The complexity of decision problems for finite-turn multicounter machines.- Alternating multihead finite automata.- The solution for the branching factor of the alpha-beta pruning algorithm.- Uniform complexity and digital signatures.- On the generation of cryptographically strong pseudo-random sequences.- Measuring the expressive power of dynamic logics: An application of abstract model theory. 564 pp. Englisch. Nº de ref. del artículo: 9783540108436
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Refined analysis and improvements on some factoring algorithms.- Absolute primality of polynomials is decidable in random polynomial time in the number of variables.- Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier . Nº de ref. del artículo: 4881121
Comprar nuevo
EUR 48,37
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, languages and programming; Lecture notes in computer science ; 115
Publicado por
Berlin ; Heidelberg [u.a.] : Springer, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
Antiguo o usado
Broschiert
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
Calificación del vendedor: 5 de 5 estrellas
Broschiert. Condición: Gut. 550 Seiten; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 950. Nº de ref. del artículo: 2014637
Comprar usado
EUR 85,00
Gastos de envío:
EUR 15,95
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1981, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
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 -Refined analysis and improvements on some factoring algorithms.- Absolute primality of polynomials is decidable in random polynomial time in the number of variables.- Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform.- Cost tradeoffs in graph embeddings, with applications.- Minimum s-t cut of a planar undirected network in o(n log2(n)) time.- On the density of color-families.- The implication problem for data dependencies.- Characterizing data base Dependencies.- Data flow analysis of applicative programs.- Flow analysis of lambda expressions.- Algorithmic specifications of abstract data types.- Nondeterminism in abstract data types.- A view of directions in relational database theory.- A new characterization of the regular languages.- Langages Reconnaissables et Codage Prefixe Pur.- Passes, sweeps and visits.- On LALR(k) testing.- On size bounds for deterministic parsers.- A decision procedure for the equivalence of two dpdas one of which is linear.- The deducibility problem in Propositional Dynamic Logic.- Finite models for deterministic propositional dynamic logic.- Impartiality, justice and fairness: The ethics of concurrent termination.- Computing a perfect strategy for n¿ chess requires time exponential in n.- On the complexity of simple arithmetic expressions.- Proving lower bounds for linear decision trees.- Parikh-bounded languages.- Generalized Parikh mappings and homomorphisms.- Chomsky-Schotzenberger representations for families of languages and grammatical types.- Algebraically specified programming systems and Hoare's logic.- Automatic construction of verification condition generators from hoare logics.- Circular expressions: Elimination of static environments.- An axiomatic approach to the Korenjak - Hopcroft algorithms.- On the (generalized) post correspondence problem with lists of length 2.- A sparse table implementation of priority queues.- Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems.- Termination of linear rewriting systems.- Realizing an equational specification.- A cook's tour of countable nondeterminism.- The complexity of decision problems for finite-turn multicounter machines.- Alternating multihead finite automata.- The solution for the branching factor of the alpha-beta pruning algorithm.- Uniform complexity and digital signatures.- On the generation of cryptographically strong pseudo-random sequences.- Measuring the expressive power of dynamic logics: An application of abstract model theory.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 564 pp. Englisch. Nº de ref. del artículo: 9783540108436
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming : Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981
Publicado por
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
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 - Refined analysis and improvements on some factoring algorithms.- Absolute primality of polynomials is decidable in random polynomial time in the number of variables.- Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform.- Cost tradeoffs in graph embeddings, with applications.- Minimum s-t cut of a planar undirected network in o(n log2(n)) time.- On the density of color-families.- The implication problem for data dependencies.- Characterizing data base Dependencies.- Data flow analysis of applicative programs.- Flow analysis of lambda expressions.- Algorithmic specifications of abstract data types.- Nondeterminism in abstract data types.- A view of directions in relational database theory.- A new characterization of the regular languages.- Langages Reconnaissables et Codage Prefixe Pur.- Passes, sweeps and visits.- On LALR(k) testing.- On size bounds for deterministic parsers.- A decision procedure for the equivalence of two dpdas one of which is linear.- The deducibility problem in Propositional Dynamic Logic.- Finite models for deterministic propositional dynamic logic.- Impartiality, justice and fairness: The ethics of concurrent termination.- Computing a perfect strategy for n¿ chess requires time exponential in n.- On the complexity of simple arithmetic expressions.- Proving lower bounds for linear decision trees.- Parikh-bounded languages.- Generalized Parikh mappings and homomorphisms.- Chomsky-Schotzenberger representations for families of languages and grammatical types.- Algebraically specified programming systems and Hoare's logic.- Automatic construction of verification condition generators from hoare logics.- Circular expressions: Elimination of static environments.- An axiomatic approach to the Korenjak - Hopcroft algorithms.- On the (generalized) post correspondence problem with lists of length 2.- A sparse table implementation of priority queues.- Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems.- Termination of linear rewriting systems.- Realizing an equational specification.- A cook's tour of countable nondeterminism.- The complexity of decision problems for finite-turn multicounter machines.- Alternating multihead finite automata.- The solution for the branching factor of the alpha-beta pruning algorithm.- Uniform complexity and digital signatures.- On the generation of cryptographically strong pseudo-random sequences.- Measuring the expressive power of dynamic logics: An application of abstract model theory. Nº de ref. del artículo: 9783540108436
Comprar nuevo
EUR 53,49
Gastos de envío:
EUR 64,22
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming | Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Automata, Languages and Programming | Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 | O. Kariv (u. a.) | Taschenbuch | x | Englisch | 1981 | Springer Spektrum | EAN 9783540108436 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 102156876
Comprar nuevo
EUR 50,10
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 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. 564. Nº de ref. del artículo: 263068968
Comprar nuevo
EUR 203,64
Gastos de envío:
EUR 3,42
A Estados Unidos de America
Cantidad disponible: 4 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. 564 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 5860343
Comprar nuevo
EUR 213,63
Gastos de envío:
EUR 7,40
De Reino Unido a Estados Unidos de America
Cantidad disponible: 4 disponibles