Automata, Languages and Programming

Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981

Häftad, Engelska, 1981

Av S. Even, O. Kariv

729 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1981-06-01
Mått170 x 250 x 31 mm
Vikt844 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor554
Upplaga1981
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540108436

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it

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×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.

Du kanske också är intresserad av

Klanen

Del 1

Klanen

299 kr

Akvarellfärg Aquafine Travel Set

Akvarellfärg Aquafine Travel Set

Daler-Rowney

379 kr

Mamma : berätta om ditt liv

Mamma : berätta om ditt liv

199 kr

Hembiträdet

Nyhet

Del 1

Hembiträdet

Freida McFadden

79 kr125 kr

Wintermans mysterier

Wintermans mysterier

269 kr

Hitster Original

Hitster Original

Jumbo

299 kr379 kr

Döda kvinnor förlåter inte

4 pocket för 3

Del 1

Döda kvinnor förlåter inte

Katarina Wennstam

125 kr

Lackeringskit DAS 75ml lack + pensel

Lackeringskit DAS 75ml lack + pensel

DAS

159 kr

Gottigheter : En kokbok till

Gottigheter : En kokbok till

Jennifer Eriksson

329 kr

Med öppen hand : visdomar att vila i

Med öppen hand : visdomar att vila i

Björn Natthiko Lindeblad, Caroline Bankler

349 kr