Automata, Languages and Programming: Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 (Lecture Notes in Computer Science, 115) - Softcover
Synopsis
Ex-Library copy that is in fabulous condition.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Automata, Languages and Programming: Eighth Colloquium,...
Stock Image
Automata, Languages and Programming: Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 (Lecture Notes in Computer Science, 115)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020159141
Stock Image
Automata, Languages and Programming: Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 (Lecture Notes in Computer Science, 115)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540108436_new
Buy New
US$ 67.67
Shipping:
US$ 15.96
From United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1981, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
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 -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. Seller Inventory # 9783540108436
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: 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 . Seller Inventory # 4881121
Buy New
US$ 58.01
Shipping:
US$ 57.04
From Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Automata, languages and programming; Lecture notes in computer science ; 115
Published by
Berlin ; Heidelberg [u.a.] : Springer, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
Used
Broschiert
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert. Condition: 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. Seller Inventory # 2014637
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1981, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
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 -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. Seller Inventory # 9783540108436
Seller Image
Automata, Languages and Programming : Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108432
ISBN 13: 9783540108436
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540108436
Seller Image
Automata, Languages and Programming | Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Automata, Languages and Programming | Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981 | S. Even (u. a.) | Taschenbuch | x | Englisch | 1981 | Springer | EAN 9783540108436 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 102156876
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. 564. Seller Inventory # 263068968
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. 564 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam. Seller Inventory # 5860343
Buy New
US$ 257.12
Shipping:
US$ 8.66
From United Kingdom to U.S.A.
Quantity: 4 available